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

DOI10.1080/09720529.2014.932128MaRDI QIDQ5069737zbMATH OpenOpenAlexFDO

Authors D. Lotfi, Mohamed El Marraki, 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) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Cites work

• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 3941580 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Distributed loop network with minimum transmission delay
• Recursive relations for the number of spanning trees
• Spanning tree formulas and Chebyshev polynomials
• Spanning trees of dual graphs
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• The number of spanning trees in odd valent circulant graphs

Cited in

(3)

• Enumeration of spanning trees in a chain of diphenylene graphs
• Enumeration of spanning trees of 2-separable networks
• Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof

This page was built for publication: The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs

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