共 50 条
On the spectral radius of graphs without a gem
被引:1
|作者:
Zhang, Yanting
[1
,2
]
Wang, Ligong
[1
,2
]
机构:
[1] Northwestern Polytech Univ, Sch Math & Stat, Xian 710129, Shaanxi, Peoples R China
[2] Northwestern Polytech Univ, Xian budapest Joint Res Ctr Combinator, Xian 710129, Shaanxi, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Gem-free graphs;
Spectral radius;
Extremal graph;
BOUNDS;
D O I:
10.1016/j.disc.2024.114171
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The gem is the 5-vertex graph consisting of a 4-vertex path plus a vertex adjacent to each vertex of the path. A graph is said to be gem-free if it does not contain gem as a subgraph. In this paper, we consider the spectral extremal problem for gem-free graphs with given size. The maximum spectral radius of gem-free graphs with size m > 11 is obtained, and the unique corresponding extremal graph is determined. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页数:7
相关论文