Spectral Radius, Edge-Disjoint Cycles and Cycles of the Same Length
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 wit...
Saved in:
Published in | The Electronic journal of combinatorics Vol. 29; no. 2 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
08.04.2022
|
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!