Computing tight upper bounds on the algebraic connectivity of certain graphs (Q958040)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing tight upper bounds on the algebraic connectivity of certain graphs |
scientific article |
Statements
Computing tight upper bounds on the algebraic connectivity of certain graphs (English)
0 references
2 December 2008
0 references
Laplacian matrix
0 references
algebraic connectivity
0 references
Bethe trees
0 references
generalized Bethe trees
0 references