Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0095-8956(81)80028-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005962499 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 30 July 2024
scientific article
| 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 |
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
