Maxima of spectral radius of irregular graphs with given maximum degree
Combinatorics
2022-09-27 v1
Abstract
Let be the maximum spectral radius of connected irregular graphs on vertices with maximum degree . Liu, Shen and Wang (2007) conjectured that which describes the asymptotic behavior for the maximum spectral radius of irregular graphs. Focusing on this conjecture, we consider the maximum spectral radius of connected subcubic bipartite graphs. The unique connected subcubic bipartite graph with the maximum spectral radius is determined. Let be a -connected irregular graph with spectral radius , we present a lower bound for . Moreover, if is a proper subgraph of a -connected -regular graph, a lower bound for is also obtained. These bounds improve some previous results.
Keywords
Cite
@article{arxiv.2209.12367,
title = {Maxima of spectral radius of irregular graphs with given maximum degree},
author = {Jie Xue and Ruifang Liu},
journal= {arXiv preprint arXiv:2209.12367},
year = {2022}
}
Comments
15 pages, 1 figures