Finding the graph with the maximum number of spanning trees (Q1146688): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generating formulas for the number of trees in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comparison of graphs by their number of spanning trees / rank | |||
Normal rank | |||
Latest revision as of 10:52, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the graph with the maximum number of spanning trees |
scientific article |
Statements
Finding the graph with the maximum number of spanning trees (English)
0 references
1980
0 references
maximum number of spanning trees
0 references
