Abstract
In this paper, we provide spectral conditions for the existence of two edge-disjoint cycles and two cycles of the same length in a graph, which can be viewed as the spectral analogues of Erdős and Posa's condition and Erdős' classic problem about the maximum number of edges of a graph without two edge-disjoint cycles and two cycles of the same length, respectively. Furthermore, we give a spectral condition to guarantee the existence of $k$ edge-disjoint triangles in a graph.
Sign-in/Register to access full text options 
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.
