Abstract
AbstractFor a graph , let be the minimum degree sum of two nonadjacent vertices in . A chord of a cycle in a graph is an edge of joining two nonconsecutive vertices of the cycle. In this paper, we prove the following result, which is an extension of a result of Brandt et al for large graphs: For positive integers and , there exists an integer such that if is a graph of order and , then can be partitioned into vertex‐disjoint cycles, each of which has at least chords.
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.
