Back to search

West Virginia University

On the s-Hamiltonian index of a graph

Abstract

dc:description.abstract

In modeling communication networks by graphs, the problem of designing s-fault-tolerant networks becomes the search for s-Hamiltonian graphs. This thesis is a study of the s-Hamiltonian index of a graph G.;A path P of G is called an arc in G if all the internal vertices of P are divalent vertices of G. We define l (G) = max{lcub}m : G has an arc of length m that is not both of length 2 and in a K3{rcub}. We show that if a connected graph G is not a path, a cycle or K1,3, then for a given s, we give the best known bound of the s-Hamiltonian index of the graph.

Degree

thesis:*
Name thesis:degree_name
MS
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Lane Department of Computer Science and Electrical Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Shao, Yehong

Subjects

dc:subject × 1

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
West Virginia University
Base URL
researchrepository.wvu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Shao, Yehong. On the s-Hamiltonian index of a graph. Thesis thesis, https://doi.org/10.33915/etd.1646