Acta mathematica scientia,Series A
• Articles • Previous Articles Next Articles
MAO Lin-Fan, LIU Yan-Pei
Online:
Published:
Supported by:
国家自然科学基金资助（Grant No.69973001）
Abstract:
For a given family G of graphs, how many rooted maps on surfaces with underlying graph in G? The authors obtain an answer for th is problem in orientable case and a new method to get the enufunction f^r(M) by using the automorphism groups of these graphs in this paper.
Key words: Graph;Map;Embedding;Automorphism group;Root polynomial
CLC Number:
MAO Lin-Fan, LIU Yan-Pei. On the Roots on Orientable Embeddings of Graph[J].Acta mathematica scientia,Series A, 2003, 23(3): 287-293.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://121.43.60.238/sxwlxbA/EN/
http://121.43.60.238/sxwlxbA/EN/Y2003/V23/I3/287
[1]Biggs N L，White A T. Permutation Groups and Combinatorial Struc tures. Cambridge: Cambridge University Press, 1979 [2]刘彦佩. 数组合地图论. 北京: 科学出版社，2001 [3]刘彦佩. 图的可嵌入性理论. 北京: 科学出版社，1994 [4]Palmer E M. The Enumeration of Graphs. In: Beineke L W,Wilson R Jed.Selected Topics in Graph Theory (I).London: Academic Press,1978.385-416 [5]Tutte W T. What is a Map? In:Harary Fed.New Directions in the Theory of Graphs. Academic Press, 1973. 309-325 [6]Tutte W T. Counting rooted triangulations.Annals of Discrete Math, 1982, 12: 243-253
Cited