On trees with maximum algebraic connectivity
From MaRDI portal
Recommendations
- Algebraic connectivity of trees with the maximum degree
- Graphs with given diameter maximizing the algebraic connectivity
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Maximizing the algebraic connectivity for a subclass of caterpillars
- Ordering trees with algebraic connectivity and diameter
Cited in
(19)- Algebraic connectivity and doubly stochastic tree matrices
- Perron value and moment of rooted trees
- Perron values and classes of trees
- Extremal results for directed tree connectivity
- Relationships between algebraic connectivity and vertex connectivity
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices
- Maximizing algebraic connectivity for certain families of graphs
- Schur reduction of trees and extremal entries of the Fiedler vector
- Ordering trees with algebraic connectivity and diameter
- The six classes of trees with the largest algebraic connectivity
- Maximizing the algebraic connectivity for a subclass of caterpillars
- Algebraic connectivity of trees with the maximum degree
- scientific article; zbMATH DE number 2046383 (Why is no real title available?)
- Combinatorial Perron values of trees and bottleneck matrices
- Absolute algebraic connectivity of trees
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- Graphs with given diameter maximizing the algebraic connectivity
- The second largest algebraic connectivity of trees with fixed diameter
- Absolute algebraic connectivity of double brooms and trees
This page was built for publication: On trees with maximum algebraic connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279872)
