Automorphisms of maps with a given underlying graph and their application to enumeration

DOI10.1007/s10114-004-0494-0zbMath1082.05029OpenAlexW2049304820MaRDI QIDQ2581145

Yanyan Li

Publication date: 9 January 2006

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-004-0494-0

zbMATH Keywords

surfacesimbeddings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (1)

Norm equalities and inequalities for three circulant operator matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree
• A classification of symmetric graphs of order \(3p\)
• Symmetric graphs of order a product of two distinct primes
• Automorphism groups and isomorphisms of Cayley digraphs
• A reductive technique for enumerating non-isomorphic planar maps
• Automorphisms of imbedded graphs
• The Enumeration of Non-Isomorphic 2-Connected Planar Maps
• Enumerating 2-Cell Imbeddings of Connected Graphs
• Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
• On the Classification of Symmetric Graphs with a Prime Number of Vertices

This page was built for publication: Automorphisms of maps with a given underlying graph and their application to enumeration