arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.00645math.CO
收藏

关于m-Cayley有向图的同构问题

On isomorphisms of $m$-Cayley digraphs

Xing Zhang, Yuan-Quan Feng, Fu-Gang Yin, Jin-Xin Zhou

AI总结:

本文研究m-Cayley有向图的同构问题,通过刻画自同构群中G的正规化子并推广CI性质,定义了mCI、mPCI、mDCI和mPDCI等概念,给出Babai型判据,并分类了m≥2时的有限mDCI群和m≥4时的有限mPDCI群。

摘要:

有向图的同构问题是图论中的一个基本问题。过去半个世纪里,Cayley有向图的同构问题得到了广泛研究。本文考虑m-Cayley有向图的同构问题,它是Cayley有向图的推广。设m为正整数。如果一个有向图容许一个自同构群G半正则地作用于顶点上且恰有m个轨道,则称其为G的m-Cayley有向图。特别地,1-Cayley有向图就是Cayley有向图。我们首先刻画了有限群G的m-Cayley有向图的全自同构群中G的正规化子。这推广了Godsil在1981年得到的关于Cayley有向图的类似结果。然后我们利用这一结果来研究m-Cayley有向图的同构。Cayley有向图的CI性质(CI表示“Cayley同构”)和DCI群(其所有Cayley有向图都是CI有向图)是Cayley有向图同构研究中的两个关键主题。我们通过定义mCI-和mPCI-有向图,以及相应的mDCI-和mPDCI-群,将这些概念推广到m-Cayley有向图。我们分别给出了与Babai关于CI有向图的判据相类似的mCI-和mPCI-有向图的判据。借助这些结果,我们对每个m≥2分类了有限mDCI群,并对每个m≥4分类了有限mPDCI群。对m-Cayley图也得到了类似的结果。注意1DCI群就是DCI群,而有限DCI群的分类是一个长期未决的公开问题,已得到大量研究。

英文摘要:

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In this paper, we consider this problem for $m$-Cayley digraphs which are generalization of Cayley digraphs. Let $m$ be a positive integer. A digraph admitting a group $G$ of automorphisms acting semiregularly on the vertices with exactly $m$ orbits is called an $m$-Cayley digraph of $G$. In particular, $1$-Cayley digraph is just the Cayley digraph. We first characterize the normalizer of $G$ in the full automorphism group of an $m$-Cayley digraph of a finite group $G$. This generalizes a similar result for Cayley digraph achieved by Godsil in 1981. Then we use this to study the isomorphisms of $m$-Cayley digraphs. The CI-property of a Cayley digraph (CI stands for `Cayley isomorphism') and the DCI-groups (whose Cayley digraphs are all CI-digraphs) are two key topics in the study of isomorphisms of Cayley digraphs. We generalize these concepts into $m$-Cayley digraphs by defining $m$CI- and $m$PCI-digraphs, and correspondingly, $m$DCI- and $m$PDCI-groups. Analogues to Babai's criterion for CI-digraphs are given for $m$CI- and $m$PCI-digraphs, respectively. With these we then classify finite $m$DCI-groups for each $m\geq 2$, and finite $m$PDCI-groups for each $m\geq 4$. Similar results are also obtained for $m$-Cayley graphs. Note that 1DCI-groups are just DCI-groups, and the classification of finite DCI-groups is a long-standing open problem that has been worked on a lot.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑