Abstract
For a 1-tough graph we define is an independent set of vertices and . D. Bauer, G. Fan and H.J.Veldman proved that for any 1-tough graph with , where is the circumference of (D. Bauer, G. Fan and H.J.Veldman,Hamiltonian properties of graphs with large neighborhood unions,Discrete Mathematics, 1991). They also conjectured a stronger upper bound for the circumference: .In this paper, we prove this conjecture.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.