On the Minimal Graph with a Given Number of Spanning Trees

DOI10.4153/CMB-1970-093-0MaRDI QIDQ5599568zbMATH OpenFDO

Authors J.Sedláček

Publication date 1970

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1970-093-0

Cited in

(5)

• Counting graphs with different numbers of spanning trees through the counting of prime partitions
• Minimal graphs with a prescribed number of spanning trees
• Chip-firing games and critical groups
• Exactly k MSTs: How many vertices suffice?
• Computational complexity of counting coincidences

This page was built for publication: On the Minimal Graph with a Given Number of Spanning Trees

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