Recursive relations for the number of spanning trees

MaRDI QIDQ3551162zbMATH OpenFDO

Authors Mohammad Hassan Shirdareh Haghighi, Khodakhast Bibak

Publication date 15 April 2010

Full work available at URL http://www.m-hikari.com/ams/ams-password-2009/ams-password45-48-2009/index.html

zbMATH Keywords

spanning treesfanwheelladder

Mathematics Subject Classification ID

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

Recommendations

• The number of spanning tree in several classes of graphs
• scientific article; zbMATH DE number 6101315
• The number of spanning trees of three special double fixed step loop networks
• Combinatorial interpretations of spanning tree identities
• Formulas for the number of spanning trees in a fan

Cited in

(9)

• The number of spanning trees of three special double fixed step loop networks
• The number of spanning tree in several classes of graphs
• Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent
• The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs
• Combinatorial interpretations of spanning tree identities
• Formulas for the number of spanning trees in a fan
• On the number of spanning trees in graphs with multiple edges
• scientific article; zbMATH DE number 3924815 (Why is no real title available?)
• The number of quasi-trees in fans and wheels

This page was built for publication: Recursive relations for the number of spanning trees

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