On the number of spanning trees in graphs with multiple edges

DOI10.1007/s12190-016-1034-7zbMath1373.05039OpenAlexW2471317570MaRDI QIDQ1677130

Hajar Sahbani, Mohamed El Marraki

Publication date: 10 November 2017

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-016-1034-7

zbMATH Keywords

spanning treesmulti-edges-fan graphmulti-edges-wheel graphmultiple edges

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites Work

• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Spanning tree formulas and Chebyshev polynomials
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Reliability Evaluation in Computer-Communication Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item