The six classes of trees with the largest algebraic connectivity
The algebraic connectivity of a graph \(G\), \(\alpha(G)\), is the \((n{-}1)\)-st eigenvalue of its Laplacian matrix. In the paper the authors introduce six classes \(C_1\dots C_6\) of trees of order \(n\), and prove that if \(T\) is a tree of order \(n\geq 15\), then \(\alpha(T)\geq 2-\sqrt{3}\) if and only if \(T\in\bigcup_{i=1}^6C_i\), where the equality holds if and only if \(T\) is a tree in class \(C_6\). Further, a complete characterization of the equality case of a well-known relation between the algebraic connectivity of a tree \(T\) and the Peron value of the bottleneck matrix of a Peron branch is given.
- 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
- Characteristic vertices of weighted trees via perron values
- 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?)
- 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
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- On two conjectures of spectral graph theory
- Perron values and classes of trees
- 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
- Six classes of trees with largest normalized algebraic connectivity
- Algebraic connectivity on a subclass of caterpillars
- Combinatorial Perron values of trees and bottleneck matrices
- Spectral bounds for the connectivity of regular graphs with given order
- Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
- Gluing of graph Laplacians and their spectra
- The ordering of limit point of algebraic connectivity of trees
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
- Ordering trees by algebraic connectivity
- The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
- Algebraic connectivity in normed spaces
- Ordering trees with nearly perfect matchings by algebraic connectivity
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)
