Algebraic connectivity and doubly stochastic tree matrices

DOI10.1016/j.laa.2008.06.009zbMath1226.05176OpenAlexW2003863405MaRDI QIDQ1002267

Xiao Dong Zhang

Publication date: 25 February 2009

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

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

zbMATH Keywords

treediameterdoubly stochastic matrixalgebraic connectivity

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Stochastic matrices (15B51)

Related Items (1)

Vertex degrees and doubly stochastic graph matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequalities for the spectra of symmetric doubly stochastic matrices
• Old and new results on algebraic connectivity of graphs
• Eigenvalues, diameter, and mean distance in graphs
• The matrix-forest theorem and measuring relations in small social groups
• Laplacian matrices of graphs: A survey
• Spanning forests and the golden ratio
• Doubly stochastic matrices of trees
• A note on doubly stochastic graph matrices
• Matrix Analysis
• A Note on degree antiregular graphs
• Inverses of Unipathic M-Matrices
• Doubly stochastic graph matrices, II
• Ordering trees by algebraic connectivity

This page was built for publication: Algebraic connectivity and doubly stochastic tree matrices