A new technique for the characterization of graphs with a maximum number of spanning trees
From MaRDI portal
Publication:1349105
DOI10.1016/S0012-365X(01)00095-4zbMath0993.05119MaRDI QIDQ1349105
Publication date: 21 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00095-4
05C05: Trees
05C30: Enumeration in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C75: Structural characterization of families of graphs
Related Items
Volume Bounds for the Phase-Locking Region in the Kuramoto Model, Construction of efficient experimental designs under multiple resource constraints, Unnamed Item, On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs, A generalization of Boesch's theorem, Spanning trees: A survey, Heuristic maximization of the number of spanning trees in regular graphs, Graphs with the maximum or minimum number of 1-factors, Undirected simple connected graphs with minimum number of spanning trees, On the minimum number of spanning trees in cubic multigraphs, Counting spanning trees using modular decomposition, On family of graphs with minimum number of spanning trees, Extremal graphs for the Tutte polynomial, A survey of some network reliability analysis and synthesis results, Counting Spanning Trees in Graphs Using Modular Decomposition