The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs (Q704836)
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: The number of spanning trees in K_ n-complements of quasi-threshold graphs |
scientific article; zbMATH DE number 2130298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs |
scientific article; zbMATH DE number 2130298 |
Statements
The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs (English)
0 references
20 January 2005
0 references
Spanning trres
0 references
Complement spanning-tree matrix theorem
0 references
Trees
0 references
Quasithreshold graphs
0 references
Combinatorial problems
0 references
Networks
0 references
0.92073905
0 references
0.91970754
0 references
0.9187844
0 references
0.9148009
0 references
0.9131304
0 references
0 references
0.90704966
0 references
