Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922)
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: Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs |
scientific article; zbMATH DE number 5569050
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs |
scientific article; zbMATH DE number 5569050 |
Statements
Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (English)
0 references
23 June 2009
0 references
spanning trees
0 references
complement-spanning-tree matrix
0 references
star-like graphs
0 references
maximization
0 references
interconnection networks
0 references
0 references
0.8928148
0 references
0.8928148
0 references
0.88550156
0 references
0.8840191
0 references
0.88122785
0 references
0.87704694
0 references
0.87704694
0 references
0 references
