On the characterization of graphs with maximum number of spanning trees
From MaRDI portal
A number of results are proved with respect to so-called \(t\)-optimal graphs, i.e. graphs which have the maximum number of spanning trees among all graphs with the same number of nodes and edges.
Recommendations
Cites work
- A certain polynomial of a graph and graphs with an extremal number of trees
- A proof of Boesch's conjecture
- Comparison of graphs by their number of spanning trees
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Laplacian matrices of graphs: A survey
- Maximizing the number of spanning trees in a graph with n nodes and m edges
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- On the existence of uniformly optimally reliable networks
- Parallel concepts in graph theory
Cited in
(39)- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- Undirected simple connected graphs with minimum number of spanning trees
- Maximum of k-th maximal spanning trees of a weighted graph
- A new technique for the characterization of graphs with a maximum number of spanning trees
- The number of spanning trees in the composition graphs
- Number of spanning trees of different products of complete and complete bipartite graphs
- Heuristic approaches to the maximization of the number of spanning trees in regular graphs
- On numbers of vertices of maximum degree in the spanning trees of a graph
- Network reliability in Hamiltonian graphs
- The maximum number of spanning trees of a graph with given matching number
- Classes of uniformly most reliable graphs for all-terminal reliability
- Number of spanning trees in the sequence of some graphs
- On family of graphs with minimum number of spanning trees
- Spanning tree results for graphs and multigraphs. A matrix-theoretic approach
- A survey of some network reliability analysis and synthesis results
- On the construction of graphs with large numbers of spanning trees
- Conditions on the distillation for determining optimal chain lengths of a graph
- scientific article; zbMATH DE number 4068900 (Why is no real title available?)
- Maximizing the number of spanning trees of networks based on cycle basis representation
- A generalization of Boesch's theorem
- Maximizing spanning trees in almost complete graphs
- Volume bounds for the phase-locking region in the Kuramoto model
- Maximizing the number of spanning trees of networks based on cycle basis representation
- Graphs with not too many spanning trees
- scientific article; zbMATH DE number 932184 (Why is no real title available?)
- scientific article; zbMATH DE number 1439503 (Why is no real title available?)
- scientific article; zbMATH DE number 5174840 (Why is no real title available?)
- scientific article; zbMATH DE number 2230252 (Why is no real title available?)
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
- Uniformly optimally reliable graphs: A survey
- Spanning trees: A survey
- Exactly k MSTs: How many vertices suffice?
- The number of spanning trees for Sierpiński graphs and data center networks
- On a conjecture of regular graphs having the minimum number of induced paths of length two
- Types of special graphs and their complexity trees
- On bipartite graphs with the minimum number of spanning trees
- Heuristic maximization of the number of spanning trees in regular graphs
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
This page was built for publication: On the characterization of graphs with maximum number of spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377718)
