On the characterization of graphs with maximum number of spanning trees (Q1377718)
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: On the characterization of graphs with maximum number of spanning trees |
scientific article; zbMATH DE number 1109990
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the characterization of graphs with maximum number of spanning trees |
scientific article; zbMATH DE number 1109990 |
Statements
On the characterization of graphs with maximum number of spanning trees (English)
0 references
14 September 1998
0 references
A number of results are proved with respect to so-called \(t\)-optimal graphs, i.e. graphs which have the maximum number of spanning trees among all graphs with the same number of nodes and edges.
0 references
spanning trees
0 references
