The six classes of trees with the largest algebraic connectivity

DOI10.1016/J.DAM.2007.08.014MaRDI QIDQ2476262zbMATH OpenOpenAlexFDO

Authors Li Zhang, Xiying Yuan, Jia-Yu Shao

Publication date 18 March 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.08.014

zbMATH Keywords

treeLaplacian matrixalgebraic connectivitybottleneck matrix

Mathematics Subject Classification ID

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

Recommendations

• Six classes of trees with largest normalized algebraic connectivity
• On trees with maximum algebraic connectivity
• Algebraic connectivity of trees with the maximum degree
• scientific article; zbMATH DE number 4114654
• Algebraic connectivity and degree sequences of trees
• Absolute algebraic connectivity of trees
• The smallest values of algebraic connectivity for trees
• The ordering of trees and connected graphs by algebraic connectivity
• Ordering trees with algebraic connectivity and diameter
• Minimizing the algebraic connectivity of trees with given matching number

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 1930773 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Characteristic vertices of weighted trees via perron values
• On algebraic connectivity and spectral integral variations of graphs
• On the Laplacian spectral radius of a tree.
• On the second largest Laplacian eigenvalue of trees
• On the two conjectures of Graffiti
• Ordering trees by algebraic connectivity
• Ordering trees by their Laplacian spectral radii
• The limit points of Laplacian spectra of graphs

Cited in

(16)

• On two conjectures of spectral graph theory
• The ordering of limit point of algebraic connectivity of trees
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
• On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
• Six classes of trees with largest normalized algebraic connectivity
• On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
• Gluing of graph Laplacians and their spectra
• Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
• Algebraic connectivity on a subclass of caterpillars
• The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
• Ordering trees by algebraic connectivity
• Spectral bounds for the connectivity of regular graphs with given order
• Ordering trees with nearly perfect matchings by algebraic connectivity
• Perron values and classes of trees
• Ordering trees and graphs with few cycles by algebraic connectivity
• Combinatorial Perron values of trees and bottleneck matrices

This page was built for publication: The six classes of trees with the largest algebraic connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476262)