New upper bounds on the spectral radius of unicyclic graphs (Q2469505): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3359644 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The largest eigenvalue of unicyclic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eigenvalues and eigenvectors of tridiagonal matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The spectra of a graph obtained from copies of a generalized Bethe tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounding the largest eigenvalue of trees in terms of the largest vertex degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4337625 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative Methods for Solving Matrix Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix theory. Basic results and techniques / rank | |||
Normal rank |
Latest revision as of 16:25, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New upper bounds on the spectral radius of unicyclic graphs |
scientific article |
Statements
New upper bounds on the spectral radius of unicyclic graphs (English)
0 references
6 February 2008
0 references
In a unicyclic graph \(G\) with maximum vertex degree \(\Delta\), let \(k\) be the maximum distance between a vertex in a cycle and a vertex not in cycle plus one. The author shows that the spectral radius of the Laplacian matrix of \(G\) is then bounded by \(\Delta+2\sqrt{\Delta-1}\cos\frac{\pi}{2k+1}\) whenever \(\Delta\geq 3\), while the spectral radius of the adjacency matrix of \(G\) is bounded just by \(2\sqrt{\Delta-1}\cos\frac{\pi}{2k+1}\) whenever \(\Delta\geq 4\) or \(\Delta=3\) and \(k\geq 4\). This is an improvement of a result of \textit{S. Hu} [Discrete Math. 307, 280--284 (2007; Zbl 1116.05050)].
0 references
Tree
0 references
Unicyclic graph
0 references
Laplacian matrix
0 references
Adjacency matrix
0 references
Spectral radius
0 references