An Implicit Degree Condition for Cyclability in Graphs
A vertex subset X of a graph G is said to be cyclable in G if there is a cycle in G containing all vertices of X. Ore  showed that the vertex set of G with cardinality n ≥ 3 is cyclable (i.e. G is hamiltonian) if the degree sum of any pair of nonadjacent vertices in G is at least n. Shi  and Ota  respectively generalized Ore’s result by considering the cyclability of any vertex subset X of G under Ore type condition. Flandrin et al.  in 2005 extended Shi’s conclusion under the condition called regional Ore′s condition. Zhu, Li and Deng  introduced the definition of implicit degrees of vertices. In this work, we generalize the result of Flandrin et al. under their type condition with implicit degree sums. More precisely, we obtain that X is cyclable in a k-connected graph G if the implicit degree sum of any pair of nonadjacent vertices u,v ∈ X i is at least the order of G, where each X i , i = 1,2, ⋯ ,k is a vertex subset of G and X = ∪ k i = 1 X i . In , the authors demonstrated that the implicit degree of a vertex is at least the degree of the vertex. Hence our result is better than the result of Flandrin et al. in some way.
KeywordsGraph Implicit degree Cycles Cyclability
Unable to display preview. Download preview PDF.
- 5.Fournier, I.: Thèse d’Etat. L.R.I., Université de Paris–Sud, France (1985)Google Scholar