Cubic graphs with minimum number of spanning trees.

MaRDI QIDQ3190858zbMATH OpenFDO

Authors Zbigniew R. Bogdanowicz

Publication date 19 September 2014

zbMATH Keywords

cubic graphsenumerationspanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Recommendations

• On the minimum number of spanning trees in cubic multigraphs
• scientific article; zbMATH DE number 140143
• scientific article; zbMATH DE number 4010555
• scientific article; zbMATH DE number 4008429
• On the minimum leaf number of cubic graphs

Cited in

(14)

• Undirected simple connected graphs with minimum number of spanning trees
• Spanning cubic graph designs
• The minimum number of spanning trees in regular multigraphs
• On the minimum number of spanning trees in cubic multigraphs
• On the minimum leaf number of cubic graphs
• Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees.
• Counting the spanning trees of the 3-cube using edge slides
• Spanning trees in subcubic graphs.
• scientific article; zbMATH DE number 4008429 (Why is no real title available?)
• scientific article; zbMATH DE number 4010555 (Why is no real title available?)
• scientific article; zbMATH DE number 140143 (Why is no real title available?)
• The edge slide graph of the 3-cube
• Minimal graphs with a prescribed number of spanning trees
• Smallest cubic graphs with prescribed properties

This page was built for publication: Cubic graphs with minimum number of spanning trees.

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