Skip to main content
MathOverflow

Return to Question

Post Closed as "Not suitable for this site" by user44191, Daniele Tampieri, Alexey Ustinov, Ryan Budney, Mikhail Katz
MathJax correction
Source Link
edit approved Mar 1 at 12:27
vidyarthi
edit approved Mar 1 at 12:27
vidyarthi
  • 2.1k
  • 1
  • 16
  • 22

Can some body help me with some source code for finding automorphism groups of regular maps?. For example: the type of graph is denoted as {p, q}$\{p, q\}$, which means that they are tessellations of the plane by regular p–gons$p$–gons such that each vertex has coordination number q$q$. Essentially I want to find automorphism group of p=8$p=8$ and q=3 ({8,3})$q=3 (\{8,3\})$ for large number of vertices, say n=100000$n=100000$.

Can some body help me with some source code for finding automorphism groups of regular maps?. For example: the type of graph is denoted as {p, q}, which means that they are tessellations of the plane by regular p–gons such that each vertex has coordination number q. Essentially I want to find automorphism group of p=8 and q=3 ({8,3}) for large number of vertices say n=100000

Can some body help me with some source code for finding automorphism groups of regular maps?. For example: the type of graph is denoted as $\{p, q\}$, which means that they are tessellations of the plane by regular $p$–gons such that each vertex has coordination number $q$. Essentially I want to find automorphism group of $p=8$ and $q=3 (\{8,3\})$ for large number of vertices, say $n=100000$.

Source Link
Zahid Malik
Zahid Malik
  • 1

Finding automorphism groups of regular graphs

Can some body help me with some source code for finding automorphism groups of regular maps?. For example: the type of graph is denoted as {p, q}, which means that they are tessellations of the plane by regular p–gons such that each vertex has coordination number q. Essentially I want to find automorphism group of p=8 and q=3 ({8,3}) for large number of vertices say n=100000