Algebraic connectivity of trees with the maximum degree
From MaRDI portal
Recommendations
- Algebraic connectivity of weighted trees under perturbation
- Algebraic connectivity and degree sequences of trees
- On trees with maximum algebraic connectivity
- Minimizing the algebraic connectivity of trees with given matching number
- Extremizing algebraic connectivity subject to graph theoretic constraints
Cited in
(16)- Some minimax problems for graphs
- Augmenting the algebraic connectivity for certain families of graphs
- Extremal results for directed tree connectivity
- Maximizing algebraic connectivity for certain families of graphs
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- The six classes of trees with the largest algebraic connectivity
- Minimizing the algebraic connectivity of trees with given matching number
- Deformation and algebraic connectivity of weighted trees
- Algebraic connectivity of weighted trees under perturbation
- On operations in which graphs are appended to trees
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- On trees with maximum algebraic connectivity
- Algebraic connectivity of trees with a pendant edge of infinite weight
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Absolute algebraic connectivity of double brooms and trees
- Algebraic connectivity and degree sequences of trees
This page was built for publication: Algebraic connectivity of trees with the maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109344)
