Highly Influential

# Ela Ìááàì Çíaeaeë Çae Ìàà Ääääêêáá Çaeaeaeaeìáîáìì

@inproceedings{MolitiernoEla, title={Ela {\`I}{\'a}{\'a}{\`a}{\`i} Ç{\'i}aeae{\"e} Çae {\`I}{\`a}{\`a} {\"A}{\"a}{\"a}{\"a}{\^e}{\^e}{\'a}{\'a} Çaeaeaeae{\`i}{\'a}{\^i}{\'a}{\`i}{\`i}}, author={Jason J. Molitierno and Michael Neumann and Bryan L. Shader} }

In this paper, quite tight lower and upper bounds are obtained on the algebraic connectivity, namely, the second-smallest eigenvalue of the Laplacian matrix, of an unweighted balanced binary tree with k levels and hence n = 2 1 vertices. This is accomplished by considering the inverse of a matrix of order k 1 readily obtained from the Laplacian matrix. It is shown that the algebraic connectivity is 1=(2 2k + 3) +O(1=2).

#### From This Paper

##### Topics from this paper.

0 Citations

19 References

Similar Papers