Abstract
An edge e of a graph G is called singular if it is not on a triangle; otherwise, e is nonsingular. A vertex is called singular if it is adjacent to a singular edge; otherwise, it is called nonsingular. We prove the following. Let G be a connected claw-free graph such that every locally disconnected vertex x ∈ V(G) satisfies the following conditions: Then G is either hamiltonian, or G is the line graph of the graph obtained from $$K_{2,3}$$ by attaching a pendant edge to its each vertex of degree two. Some results on forbidden subgraph conditions for hamiltonicity in 3-connected claw-free graphs are also obtained as immediate corollaries
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
