English

Ratio of Symmetries Between any two n-Node Graphs

Combinatorics 2023-04-11 v4

Abstract

Given any two graphs on the same vertex set, G1=(V,E1)G_1 = (V, E_1) and G2=(V,E2)G_2 = (V, E_2), along with the difference between the two graphs Δ=(E1E2)(E2E1)\Delta = (E_1 \setminus E_2) \cup (E_2 \setminus E_1), we prove that the ratio of the sizes of the two graphs' automorphism groups is equivalent to the ratio of the sizes of Δ\Delta's automorphism orbits in G1G_1 and G2G_2 respectively. This result provides a link between graphs' symmetries that might otherwise seem to be unrelated.

Keywords

Cite

@article{arxiv.2205.05726,
  title  = {Ratio of Symmetries Between any two n-Node Graphs},
  author = {Justus Isaiah Hibshman},
  journal= {arXiv preprint arXiv:2205.05726},
  year   = {2023}
}
R2 v1 2026-06-24T11:14:44.252Z