1. On the spectral radius of quasi-k-cyclic graphs
- Author
-
Geng, Xianya, Li, Shuchao, and Simić, Slobodan K.
- Subjects
- *
GRAPH theory , *RADIUS (Geometry) , *SPECTRAL theory , *GRAPH connectivity , *MATRICES (Mathematics) , *MATHEMATICAL analysis - Abstract
Abstract: A connected graph is called a quasi-k-cyclic graph, if there exists a vertex such that is a k-cyclic graph (connected with cyclomatic number k). In this paper we identify in the set of quasi-k-cyclic graphs (for ) those graphs whose spectral radius of the adjacency matrix (and the signless Laplacian if ) is the largest. In addition, for quasi-unicyclic graphs we identify as well those graphs whose spectral radius of the adjacency matrix is the second largest. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF