Ordering trees and graphs with few cycles by algebraic connectivity (Q2250940)
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: Ordering trees and graphs with few cycles by algebraic connectivity |
scientific article; zbMATH DE number 6319414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordering trees and graphs with few cycles by algebraic connectivity |
scientific article; zbMATH DE number 6319414 |
Statements
Ordering trees and graphs with few cycles by algebraic connectivity (English)
0 references
22 July 2014
0 references
algebraic connectivity
0 references
graph ordering
0 references
Laplacian matrix
0 references
tree ordering
0 references
0 references
0 references
0 references
0.8521994352340698
0 references
0.8382466435432434
0 references
0.8327867984771729
0 references
0.8289164900779724
0 references
0.8227571845054626
0 references
