论文标题
任何两个n节图之间的对称性比率
Ratio of Symmetries Between any two n-Node Graphs
论文作者
论文摘要
给定同一顶点集上的任何两个图，$ g_1 =（v，e_1）$和$ g_2 =（v，e_2）$，以及两个图之间的差异$δ=（e_1 \ setMinus e_2）\ cup（e_2 \ setMinus e_1） $ g_1 $和$ g_2 $的$δ$的汽车轨道的尺寸。该结果提供了图形的对称性之间的联系，否则似乎是无关的。
Given any two graphs on the same vertex set, $G_1 = (V, E_1)$ and $G_2 = (V, E_2)$, along with the difference between the two graphs $Δ= (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 $Δ$'s automorphism orbits in $G_1$ and $G_2$ respectively. This result provides a link between graphs' symmetries that might otherwise seem to be unrelated.
