The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs

DOI10.1080/09720529.2014.932128zbMath1495.05135OpenAlexW2284114063MaRDI QIDQ5069737

Mohamed El Marraki, Dounia Lotfi, Driss Aboutajdine

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2014.932128

zbMATH Keywords

bipartite graphspanning treedual graphreduced graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Spanning tree formulas and Chebyshev polynomials
• Distributed loop network with minimum transmission delay
• The number of spanning trees in odd valent circulant graphs
• Spanning trees of dual graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item