Pages that link to "Item:Q4047568"
From MaRDI portal
The following pages link to Maximizing the number of spanning trees in a graph with n nodes and m edges (Q4047568):
Displayed 6 items.
- Finding the graph with the maximum number of spanning trees (Q1146688) (← links)
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692) (← links)
- D-optimal block designs with at most six varieties (Q1162329) (← links)
- On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
- Do nearly balanced multigraphs have more spanning trees? (Q3708037) (← links)
- A reliability-improving graph transformation with applications to network reliability (Q3989403) (← links)
