文献类型：期刊文献

英文题名：Maximum degree and spectral radius of graphs in terms of size

作者：Wang, Zhiwen[1];Guo, Ji-Ming[1]

机构：[1]East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China

年份：2024

卷号：59

期号：1

起止页码：213

外文期刊名：JOURNAL OF ALGEBRAIC COMBINATORICS

收录：;WOS:【SCI-EXPANDED(收录号:WOS:001145464500001)】；

基金：We would like to gratefully thank anonymous referees for their careful reading and valuable comments which led to an improved version of the paper.

语种：英文

外文关键词：Spectral radius; Maximum degree; Size

摘要：Denote by rho(G) and kappa(G) the spectral radius and the signless Laplacian spectral radius of a graph G, respectively. Let k >= 0 be a fixed integer and G be a graph of size m which is large enough. We show that if rho(G) >= root m - k, then C-4 subset of G or K-1,K-m-k subset of G. Moreover, we prove that if kappa(G) >= m - k + 1, then K-1,K-m-k subset of G. Both these results extend some known results.