Do nearly balanced multigraphs have more spanning trees?

DOI10.1002/JGT.3190090306MaRDI QIDQ3708037zbMATH OpenOpenAlexFDO

Authors Ching-Shui Cheng, Chi Song Wong, Joseph C. Masaro

Publication date 1985

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190090306

zbMATH Keywords

multigraphsspanning trees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1439503
• scientific article; zbMATH DE number 140143
• scientific article; zbMATH DE number 932184
• On the minimum number of spanning trees in cubic multigraphs
• Spanning trees and orientation of graphs

Cites work

• Algebraic Graph Theory
• Inequalities: theory of majorization and its applications
• Maximizing the number of spanning trees in a graph with n nodes and m edges

Cited in

(6)

• On the optimality of block designs
• The minimum number of spanning trees in regular multigraphs
• On the minimum number of spanning trees in cubic multigraphs
• A note on robustness of D-optimal block designs for two-colour microarray experiments
• scientific article; zbMATH DE number 1439503 (Why is no real title available?)
• Cubic graphs and quartic graphs with the minimum number of spanning forests

This page was built for publication: Do nearly balanced multigraphs have more spanning trees?

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