Algebraic connectivity and doubly stochastic tree matrices
From MaRDI portal
Publication:1002267
DOI10.1016/J.LAA.2008.06.009zbMATH Open1226.05176OpenAlexW2003863405MaRDI QIDQ1002267FDOQ1002267
Authors: 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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Distance in graphs (05C12) Stochastic matrices (15B51)
Cites Work
- Matrix Analysis
- The matrix-forest theorem and measuring relations in small social groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laplacian matrices of graphs: A survey
- Title not available (Why is that?)
- Old and new results on algebraic connectivity of graphs
- Eigenvalues, diameter, and mean distance in graphs
- Inverses of Unipathic M-Matrices
- Spanning forests and the golden ratio
- Ordering trees by algebraic connectivity
- Title not available (Why is that?)
- A note on doubly stochastic graph matrices
- Inequalities for the spectra of symmetric doubly stochastic matrices
- Doubly stochastic matrices of trees
- A Note on degree antiregular graphs
- Doubly stochastic graph matrices, II
Cited In (4)
This page was built for publication: Algebraic connectivity and doubly stochastic tree matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002267)
