Undirected simple connected graphs with minimum number of spanning trees

DOI10.1016/j.disc.2008.08.010zbMath1202.05021OpenAlexW2054979463MaRDI QIDQ1025924

Zbigniew R. Bogdanowicz

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.08.010

zbMATH Keywords

enumerationspanning treeundirected simple graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (9)

On family of graphs with minimum number of spanning trees ⋮ Extremal graphs for the Tutte polynomial ⋮ Uniformly optimally reliable graphs: A survey ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On the minimum number of spanning trees in cubic multigraphs ⋮ Chordal 2‐Connected Graphs and Spanning Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• A new technique for the characterization of graphs with a maximum number of spanning trees
• On the characterization of graphs with maximum number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• Threshold graphs and related topics
• On graphs with randomly deleted edges
• Least reliable networks and the reliability domination
• A reliability-improving graph transformation with applications to network reliability
• Network transformations and bounding network reliability

This page was built for publication: Undirected simple connected graphs with minimum number of spanning trees