Computing tight upper bounds on the algebraic connectivity of certain graphs (Q958040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing tight upper bounds on the algebraic connectivity of certain graphs |
scientific article; zbMATH DE number 5376920
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing tight upper bounds on the algebraic connectivity of certain graphs |
scientific article; zbMATH DE number 5376920 |
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
