本刊英文版Vol.21(2005),No.2论文摘要

Automorphisms of Maps with a Given Underlying Graph and Their Application to Enumeration Lin Fan MAO Yan Pei 1IU Feng TIAN A graph is called a semi-regular graph if its automorphism group action on its ordered pair of adjacent vertices is semi-regular. In this paper, a necessary and sufficient condition for an automorphism of the graph T to be an automorphism of a map with the underlying graph Γis obtained. Using this result, all orientation-preserving automorphisms of maps on