A new technique for the characterization of graphs with a maximum number of spanning trees (Q1349105)
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: A new technique for the characterization of graphs with a maximum number of spanning trees |
scientific article; zbMATH DE number 1743035
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new technique for the characterization of graphs with a maximum number of spanning trees |
scientific article; zbMATH DE number 1743035 |
Statements
A new technique for the characterization of graphs with a maximum number of spanning trees (English)
0 references
21 May 2002
0 references
spanning trees
0 references
\(t\)-optimal graphs
0 references
characterizations
0 references
degree sequence
0 references
multipartite graphs
0 references
0.9699544
0 references
0.92166114
0 references
0.9174492
0 references
0.91731834
0 references
0.91356355
0 references
0.9085175
0 references
0.9064485
0 references
0.9064485
0 references
