Ordering trees with algebraic connectivity and diameter

DOI10.1016/j.laa.2007.07.018zbMath1125.05067OpenAlexW2032596201MaRDI QIDQ2459973

Xiao Dong Zhang

Publication date: 9 November 2007

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

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

zbMATH Keywords

treediameterLaplacian matrixalgebraic connectivity

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (9)

Trees with matrix weights: Laplacian matrix and characteristic-like vertices ⋮ The algebraic connectivity of graphs with given matching number ⋮ Ordering trees by algebraic connectivity ⋮ On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph ⋮ On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Algebraic connectivity on a subclass of caterpillars ⋮ Ordering trees by the Laplacian coefficients ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplace eigenvalues of graphs---a survey
• Lower bounds of the Laplacian spectrum of graphs based on diameter
• Old and new results on algebraic connectivity of graphs
• Eigenvalues, diameter, and mean distance in graphs
• Recent results in the theory of graph spectra
• Laplacian matrices of graphs: A survey
• On trees with perfect matchings
• An upper bound on algebraic connectivity of graphs with many cutpoints
• The Laplacian Spectrum of a Graph
• Matrix Analysis
• Eigenvectors of acyclic matrices
• Extremizing algebraic connectivity subject to graph theoretic constraints
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• A survey of graph laplacians
• Inequalities: theory of majorization and its applications
• Ordering trees by algebraic connectivity

This page was built for publication: Ordering trees with algebraic connectivity and diameter