Spectral radius, edge-disjoint cycles and cycles of the same length

被引:8
|
作者
Lin, Huiqiu [1 ]
Zhai, Mingqing [2 ]
Zhao, Yanhua [1 ]
机构
[1] East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China
[2] Chuzhou Univ, Sch Math & Finance, Chuzhou 239012, Anhui, Peoples R China
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2022年 / 29卷 / 02期
关键词
ODD CYCLES; GRAPHS; NUMBER; CLIQUES;
D O I
10.37236/10783
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 Erdos and Posa's condition and Erdos' 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.
引用
收藏
页数:26
相关论文
共 50 条