Abstract
Let be a simple graph of order . For , the -matrix of is defined as , where and are the adjacency matrix and the diagonal matrix of vertex degrees of , respectively. The largest eigenvalue of , denoted by , is called the spectral radius of . We give an upper bound on for -connected irregular graphs. Moreover, we also derive an upper bound on when is a subgraph of a -connected regular graph. Our results improve or extend the existing results, respectively.
Citation
Jianxi Li. Hongzhang Chen. Peng Huang. "BOUNDING THE -SPECTRAL RADIUS OF -CONNECTED IRREGULAR GRAPHS." Rocky Mountain J. Math. 54 (1) 227 - 234, February 2024. https://doi.org/10.1216/rmj.2024.54.227
Information