Pages that link to "Item:Q1377718"
From MaRDI portal
The following pages link to On the characterization of graphs with maximum number of spanning trees (Q1377718):
Displaying 32 items.
- A generalization of Boesch's theorem (Q409456) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Heuristic maximization of the number of spanning trees in regular graphs (Q855940) (← links)
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming (Q888509) (← links)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- Undirected simple connected graphs with minimum number of spanning trees (Q1025924) (← links)
- Maximum of k-th maximal spanning trees of a weighted graph (Q1092057) (← links)
- A new technique for the characterization of graphs with a maximum number of spanning trees (Q1349105) (← links)
- The number of spanning trees in the composition graphs (Q1718771) (← links)
- Number of spanning trees of different products of complete and complete bipartite graphs (Q1719484) (← links)
- Heuristic approaches to the maximization of the number of spanning trees in regular graphs (Q1840930) (← links)
- On numbers of vertices of maximum degree in the spanning trees of a graph (Q1923502) (← links)
- Network reliability in Hamiltonian graphs (Q2234742) (← links)
- The maximum number of spanning trees of a graph with given matching number (Q2239004) (← links)
- Classes of uniformly most reliable graphs for all-terminal reliability (Q2322865) (← links)
- Number of spanning trees in the sequence of some graphs (Q2325140) (← links)
- On family of graphs with minimum number of spanning trees (Q2637716) (← links)
- A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
- (Q3801573) (← links)
- Maximizing the number of spanning trees of networks based on cycle basis representation (Q3828018) (← links)
- Maximizing spanning trees in almost complete graphs (Q4355482) (← links)
- Volume Bounds for the Phase-Locking Region in the Kuramoto Model (Q4608081) (← links)
- Maximizing the number of spanning trees of networks based on cycle basis representation (Q4731203) (← links)
- Graphs with not too many spanning trees (Q4861349) (← links)
- On graphs with the maximum number of spanning trees (Q4894608) (← links)
- (Q5294907) (← links)
- (Q5708545) (← links)
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend (Q6085882) (← links)
- Uniformly optimally reliable graphs: A survey (Q6085885) (← links)
- Exactly \(k\) MSTs: How many vertices suffice? (Q6606169) (← links)
- The number of spanning trees for Sierpiński graphs and data center networks (Q6614885) (← links)
