On the spectral radius of unicyclic and bicyclic graphs with a fixed diameter
Combinatorics
2021-06-18 v1
Abstract
The -spectral radius of a connected graph is the spectral radius of -matrix of . In this paper, we discuss the methods for comparing -spectral radius of graphs. As applications, we characterize the graphs with the maximal -spectral radius among all unicyclic and bicyclic graphs of order with diameter , respectively. Finally, we determine the unique graph with maximal signless Laplacian spectral radius among bicyclic graphs of order with diameter .
Keywords
Cite
@article{arxiv.2106.09238,
title = {On the spectral radius of unicyclic and bicyclic graphs with a fixed diameter},
author = {F. F. Wang and H. Y. Shan and Y. Y. Zhai},
journal= {arXiv preprint arXiv:2106.09238},
year = {2021}
}