Pages that link to "Item:Q1159692"

The following pages link to Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692):

Displaying 34 items.

• A generalization of Boesch's theorem (Q409456) (← links)
• Some optimal block designs with nested rows and columns for research on alternative methods of limiting slug damage (Q451337) (← links)
• Spanning trees: A survey (Q659663) (← links)
• Laplace eigenvalues of graphs---a survey (Q686298) (← links)
• On the D-optimality of group divisible designs (Q792726) (← links)
• Heuristic maximization of the number of spanning trees in regular graphs (Q855940) (← links)
• On the determination and construction of MV-optimal block designs for comparing test treatments with a standard treatment (Q1079905) (← links)
• D-optimal block designs with at most six varieties (Q1162329) (← links)
• Some sufficient conditions for type 1 optimality with applications to regular graph designs (Q1263909) (← links)
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs (Q1297626) (← links)
• On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
• A-optimal connected block designs with nearly minimal number of observations (Q1378810) (← links)
• Graphs, networks, and linear unbiased estimates (Q1408450) (← links)
• The number of spanning trees in a new lexicographic product of graphs (Q1616174) (← links)
• Optimal regular graph designs (Q1702287) (← links)
• Optimal incomplete-block designs with low replication: a unified approach using graphs (Q2063878) (← links)
• The maximum number of spanning trees of a graph with given matching number (Q2239004) (← links)
• On the minimum number of spanning trees in cubic multigraphs (Q2282470) (← links)
• Optimal designs for treatment comparisons represented by graphs (Q2316746) (← links)
• A limit characterization for the number of spanning trees of graphs (Q2390271) (← links)
• A note on robustness of D-optimal block designs for two-colour microarray experiments (Q2434707) (← links)
• A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design (Q2480023) (← links)
• On family of graphs with minimum number of spanning trees (Q2637716) (← links)
• Extremal graphs for the Tutte polynomial (Q2664552) (← links)
• A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
• Graph complexity and the laplacian matrix in blocked experiments (Q3199446) (← links)
• Some new methods for establishing the optimality of block designs having unequally replicated treatments (Q3352319) (← links)
• On unreliability polynomials and graph connectivity in reliable network synthesis (Q3478240) (← links)
• Construction of efficient experimental designs under multiple resource constraints (Q4628716) (← links)
• The number of spanning trees of a graph with given matching number (Q5739584) (← links)
• On the existence of uniformly optimally reliable networks (Q5753729) (← links)
• The number of spanning trees of a graph (Q5897169) (← links)
• On maximum graphs in Tutte polynomial posets (Q6064837) (← links)
• Uniformly optimally reliable graphs: A survey (Q6085885) (← links)