Counting the number of spanning trees in the star flower planar map

MaRDI QIDQ4924307zbMATH OpenFDO

Authors A. Modabish, Mohamed El Marraki

Publication date 31 May 2013

Full work available at URL http://www.m-hikari.com/ams/ams-2012/ams-49-52-2012/index.html

zbMATH Keywords

mapsspanning treesstar flower planar map

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Formulas for the number of spanning trees in a maximal planar map
• The number of spanning trees of certain families of planar maps
• The number of spanning trees of a family of plane graph
• A formula for the number of spanning trees of a multi-star related graph
• On the number of spanning trees of multi-star related graphs

Cited in

(3)

• Formulas for the number of spanning trees in a maximal planar map
• The number of spanning trees of certain families of planar maps
• Enumeration of spanning trees in a chain of diphenylene graphs

This page was built for publication: Counting the number of spanning trees in the star flower planar map

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