The minimal Laplacian spectral radius of trees with a given diameter

DOI10.1016/j.tcs.2008.09.060zbMath1161.05045OpenAlexW2026465183MaRDI QIDQ1001902

Zhonghua Lu, Jin-Long Shu, Rui-fang Liu

Publication date: 19 February 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.060

zbMATH Keywords

treediameterLaplacian spectral radius

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

The algebraic connectivity of graphs with given circumference ⋮ The minimal Laplacian spectral radius of trees with diameter 4 ⋮ Semiregular trees with minimal Laplacian spectral radius ⋮ Delta invariant for Eulerian digraphs

Cites Work

• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• On the spectral radius of trees with fixed diameter
• On the Laplacian spectral radius of trees with fixed diameter
• Unnamed Item
• Unnamed Item

This page was built for publication: The minimal Laplacian spectral radius of trees with a given diameter