On the spectral radii of bicyclic graphs with fixed independence number
Combinatorics
2014-02-25 v1
Abstract
Bicyclic graph is a connected graph in which the number of edges equals the number of vertices plus one. In this paper, we determine the graph which alone maximizes the spectral radii among all the bicyclic graphs on vertices with fixed independence number.
Cite
@article{arxiv.1402.5887,
title = {On the spectral radii of bicyclic graphs with fixed independence number},
author = {Xiying Yuan},
journal= {arXiv preprint arXiv:1402.5887},
year = {2014}
}
Comments
13pages