The number of spanning trees in 4-regular simple graphs

DOI10.37236/12576MaRDI QIDQ6671582zbMATH OpenFDO

Authors Jean-Sébastien Sereni, Zelealem B. Yilma

Publication date 27 January 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12576

zbMATH Keywords

maximum number of spanning trees

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• The number of bounded‐degree spanning trees
• The number of spanning trees in graphs with a given degree sequence
• The number of spanning trees in regular graphs
• Spanning trees in graphs of minimum degree 4 or 5
• On the minimum number of spanning trees in cubic multigraphs

Cites work

• On the minimum number of spanning trees in cubic multigraphs
• On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
• Spanning trees in regular graphs
• The minimum number of spanning trees in regular multigraphs
• The number of spanning trees in graphs with a given degree sequence
• The number of spanning trees in regular graphs

Cited in

(2)

• Maximum number of spanning trees and connectivity: graphs with a fixed minimum degree and bipartite graphs
• Cubic graphs and quartic graphs with the minimum number of spanning forests

This page was built for publication: The number of spanning trees in 4-regular simple graphs

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