The second smallest eigenvalue of a complete binary tree

293 Views Asked by At

Apparently it is true that the second smallest eigenvalue of a complete binary tree is $\theta(\frac{1}{n})$. Can someone point out a reference which proves this?

1

There are 1 best solutions below

0
On

In Stephen Guattery and Gary L. Miller. On the Performance of Spectral Graph Partitioning Methods. CS CMU-CS-94-228 (Carnegie Mellon University Tech Report), this result is proved as Lemma 3.8.