The number of spanning trees of planar maps: Theory and applications

Abstract

The number of spanning trees of a map C is the total number of distinct spanning subgraphs of C that are trees. In this paper, we give some methods to facilitate the calculation of the number of spanning trees for planar maps and derive several simple formulas for the number of spanning trees of special families of maps called (n-Tent chains, n-Home chains… (More)

17 Figures and Tables

Topics

  • Presentations referencing similar topics