Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692)
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 total number of spanning trees in a graph: two related problems in graph theory and optimum design theory |
scientific article; zbMATH DE number 3745217
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory |
scientific article; zbMATH DE number 3745217 |
Statements
Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (English)
0 references
1981
0 references
D-optimum design
0 references
multipartite graph
0 references
spanning trees
0 references
0 references
