On the spectral radius of trees with fixed diameter

DOI10.1016/j.laa.2005.08.008zbMath1082.05060OpenAlexW2083533416MaRDI QIDQ817642

Ji-Ming Guo, Jia-yu Shao

Publication date: 16 March 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2005.08.008

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (30)

On the spectral radius of unicyclic graphs with fixed diameter ⋮ On the Laplacian spectral radius of trees with fixed diameter ⋮ On the spectral radius of bicyclic graphs with \(n\) vertices and diameter \(d\) ⋮ Some notes on graphs whose index is close to 2 ⋮ The minimal spectral radius of graphs with a given diameter ⋮ The first two largest spectral radii of uniform supertrees with given diameter ⋮ On spectral radius of graphs with pendant paths ⋮ Disproof of a conjecture on the minimum spectral radius and the domination number ⋮ On the \(\alpha\)-index of minimally 2-connected graphs with given order or size ⋮ On minimally 2-(edge)-connected graphs with extremal spectral radius ⋮ On the spectral radius of trees with given independence number ⋮ On the spectral radius of tricyclic graphs with a maximum matching ⋮ The minimum spectral radius of graphs with a given domination number ⋮ On the spectral moments of unicyclic graphs with fixed diameter ⋮ New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree ⋮ The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices ⋮ On the spectral radius of quasi-tree graphs ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) ⋮ On the spectral radius of bi-block graphs with given independence number \(\alpha\) ⋮ Distance between the spectra of certain graphs ⋮ The matching polynomials and spectral radii of uniform supertrees ⋮ Graphs with given diameter maximizing the spectral radius ⋮ Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices) ⋮ On the spectral radius of bipartite graphs with given diameter ⋮ The least eigenvalue of graphs with given connectivity ⋮ The minimal Laplacian spectral radius of trees with a given diameter ⋮ On the spectral radius of tricyclic graphs with a fixed diameter ⋮ On the index of tricyclic graphs with perfect matchings ⋮ On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree ⋮ On the α-spectral radius of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the two largest eigenvalues of trees
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Ordering trees by their largest eigenvalues
• On the spectral radius of trees

This page was built for publication: On the spectral radius of trees with fixed diameter