Finding the graph with the maximum number of spanning trees

DOI10.1016/0016-0032(80)90012-5MaRDI QIDQ1146688zbMATH OpenOpenAlexFDO

Authors Samuel D. Bedrosian, George V. Moustakides

Publication date 1980

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(80)90012-5

zbMATH Keywords

maximum number of spanning trees

Mathematics Subject Classification ID

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

Cites work

• Comparison of graphs by their number of spanning trees
• Generating formulas for the number of trees in a graph
• Maximizing the number of spanning trees in a graph with n nodes and m edges

This page was built for publication: Finding the graph with the maximum number of spanning trees

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