Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
From MaRDI portal
Publication:1159692
DOI10.1016/S0095-8956(81)80028-7zbMath0475.05050OpenAlexW2005962499MaRDI QIDQ1159692
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(81)80028-7
Related Items
The number of spanning trees in a new lexicographic product of graphs, On the determination and construction of MV-optimal block designs for comparing test treatments with a standard treatment, On family of graphs with minimum number of spanning trees, Heuristic maximization of the number of spanning trees in regular graphs, A limit characterization for the number of spanning trees of graphs, Graph complexity and the laplacian matrix in blocked experiments, On unreliability polynomials and graph connectivity in reliable network synthesis, On the characterization of graphs with maximum number of spanning trees, A-optimal connected block designs with nearly minimal number of observations, Extremal graphs for the Tutte polynomial, On maximum graphs in Tutte polynomial posets, Uniformly optimally reliable graphs: A survey, A generalization of Boesch's theorem, Graphs, networks, and linear unbiased estimates, Optimal regular graph designs, A note on robustness of D-optimal block designs for two-colour microarray experiments, D-optimal block designs with at most six varieties, Some optimal block designs with nested rows and columns for research on alternative methods of limiting slug damage, Construction of efficient experimental designs under multiple resource constraints, Spanning trees: A survey, The number of spanning trees of a graph, The maximum number of spanning trees of a graph with given matching number, Laplace eigenvalues of graphs---a survey, A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design, The number of spanning trees of a graph with given matching number, On the existence of uniformly optimally reliable networks, Some new methods for establishing the optimality of block designs having unequally replicated treatments, A survey of some network reliability analysis and synthesis results, On the minimum number of spanning trees in cubic multigraphs, Some sufficient conditions for type 1 optimality with applications to regular graph designs, Optimal incomplete-block designs with low replication: a unified approach using graphs, Optimal designs for treatment comparisons represented by graphs, Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs, On the D-optimality of group divisible designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality of certain asymmetrical experimental designs
- A certain polynomial of a graph and graphs with an extremal number of trees
- On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
- Maximizing the number of spanning trees in a graph with n nodes and m edges
- Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
