Neighborhood union of independent sets and hamiltonicity of claw-free graphs
โ Scribed by Xinping Xu
- Book ID
- 107500741
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 2005
- Tongue
- English
- Weight
- 257 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we give the following result: Let G be a 2-connected graph of order PZ> 13 and nd2az -3, where 02 = min{d(u) + d(u): uz'.$E(G)}. If the set of claw-centers of G is independent, then either G is hamiltonian or G belongs to three classes of exceptional graphs. The bound n <202 -3 is sha
Let G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of order n such that for all u, ve V(G), 2 where dist(u,v) is the distance between u and v in G, then either G is hamiltonian, or G is a spanning subgraph of a graph in one of three families of exceptional graphs.