On the minimum number of spanning trees in cubic multigraphs
From MaRDI portal
Publication:2282470
DOI10.7151/dmgt.2123zbMath1430.05013OpenAlexW2811293829WikidataQ129586964 ScholiaQ129586964MaRDI QIDQ2282470
Publication date: 8 January 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2123
Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Connectivity (05C40) Vertex degrees (05C07)
Related Items (1)
Cites Work
- 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 family of graphs with minimum number of spanning trees
- On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
- The number of spanning trees in graphs with a given degree sequence
- Chordal 2‐Connected Graphs and Spanning Trees
- Unnamed Item
- Unnamed Item
This page was built for publication: On the minimum number of spanning trees in cubic multigraphs