Estimating the algebraic connectivity of triangle-free graphs (Q5402075)
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: Estimating the algebraic connectivity of triangle-free graphs |
scientific article; zbMATH DE number 6268616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating the algebraic connectivity of triangle-free graphs |
scientific article; zbMATH DE number 6268616 |
Statements
Estimating the algebraic connectivity of triangle-free graphs (English)
0 references
12 March 2014
0 references
Laplacian matrix
0 references
algebraic connectivity
0 references
characteristic polynomial
0 references
principal submatrix
0 references
interlacing
0 references
regular graphs
0 references
0.8186957836151123
0 references
0.8029289245605469
0 references
0.7923876047134399
0 references
0.7910666465759277
0 references
