DocumentCode
2136501
Title
The number of spanning trees of planar maps: Theory and applications
Author
Modabish, Abdulhafid ; Lotfi, Dounia ; El Marraki, M.
Author_Institution
Dept. of Comput. Sci., Univ. of Mohamed V, Rabat, Morocco
fYear
2011
fDate
7-9 April 2011
Firstpage
1
Lastpage
6
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, n-Kite chains, n-Envelope chains).
Keywords
trees (mathematics); distinct spanning subgraph; n-envelope chains; n-home chains; n-kite chains; n-tent chains; planar maps; spanning trees; Complexity theory; Computer network reliability; Computers; Electronic mail; Equations; Reliability; Transforms; complexity; maps; n-Envelope chains; n-Home chains; n-Kite chains; n-Tent chains; spanning trees;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Computing and Systems (ICMCS), 2011 International Conference on
Conference_Location
Ouarzazate
ISSN
Pending
Print_ISBN
978-1-61284-730-6
Type
conf
DOI
10.1109/ICMCS.2011.5945739
Filename
5945739
Link To Document