Minimal graphs with a prescribed number of spanning trees

MaRDI QIDQ5080912zbMATH OpenFDO

Authors Richard A. Stong

Publication date 31 May 2022

Full work available at URL http://ajc.maths.uq.edu.au/pdf/82/ajc_v82_p182.pdf

Mathematics Subject Classification ID

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

Recommendations

• Undirected simple connected graphs with minimum number of spanning trees
• On family of graphs with minimum number of spanning trees
• scientific article; zbMATH DE number 1439503
• Cubic graphs with minimum number of spanning trees.
• Counting graphs with different numbers of spanning trees through the counting of prime partitions

Cites work

• scientific article; zbMATH DE number 611919 (Why is no real title available?)
• On the Minimal Graph with a Given Number of Spanning Trees
• On the minimum number of vertices and edges in a graph with a given number of spanning trees
• Pseudo-radius of point sets and packing number

Cited in

(11)

• Undirected simple connected graphs with minimum number of spanning trees
• Spanning trees in graphs of minimum degree 4 or 5
• Minimum degree and minimum number of edge-disjoint trees
• Minimum monopoly in regular and tree graphs
• On the minimum number of components in a cotree of a graph
• Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees.
• On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
• scientific article; zbMATH DE number 165095 (Why is no real title available?)
• Exactly k MSTs: How many vertices suffice?
• Computational complexity of counting coincidences
• A note on universal graphs for spanning trees

Describes a project that uses

Uses Software

• MathOverflow

This page was built for publication: Minimal graphs with a prescribed number of spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080912)