On family of graphs with minimum number of spanning trees

DOI10.1007/s00373-012-1228-1zbMath1290.05088OpenAlexW1972805107MaRDI QIDQ2637716

Zbigniew R. Bogdanowicz

Publication date: 14 February 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1228-1

zbMATH Keywords

enumerationminimizationspanning treecounting spanning treesundirected simple graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (3)

Uniformly optimally reliable graphs: A survey ⋮ 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

Cites Work

• Unnamed Item
• Undirected simple connected graphs with minimum number of spanning trees
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design 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
• A reliability-improving graph transformation with applications to network reliability
• Network transformations and bounding network reliability

This page was built for publication: On family of graphs with minimum number of spanning trees