Pages that link to "Item:Q4950388"
From MaRDI portal
The following pages link to Tight bounds on the algebraic connectivity of a balanced binary tree (Q4950388):
Displaying 10 items.
- Intervals of balanced binary trees in the Tamari lattice (Q764359) (← links)
- Tight bounds on the algebraic connectivity of Bethe trees (Q855576) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Computing tight upper bounds on the algebraic connectivity of certain graphs (Q958040) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- The spectrum of the Laplacian matrix of a balanced binary tree (Q1611867) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- Maximizing algebraic connectivity for certain families of graphs (Q2261533) (← links)
- Balancing Bounded Treewidth Circuits (Q3569746) (← links)
- The spectrum of the Laplacian matrix of a balanced \(2^p\)ary tree (Q6646640) (← links)