Abstract
A graph G is called { H 1 , H 2 , … , H k } -free if G contains no induced subgraph isomorphic to any H i , 1 ⩽ i ⩽ k . Let G be a 2-connected { K 1 , 4 , K 1 , 4 + e } -free graph of order n ⩾ 13 . If δ ( G ) ⩾ n / 4 , then G is hamiltonian or G ∈ F , where K 1 , 4 + e is a graph obtained by joining a pair of nonadjacent vertices in a K 1 , 4 and F is a family of nonhamiltonian graphs of connectivity 2.
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.
