arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.02524math.GR
收藏

二部Kneser图的自同构群

The automorphism group of the bipartite Kneser graph

S. Morteza Mirafzal

摘要:

令$n$和$k$是整数,其中$n>2k, k\geq1$。我们用$H(n, k)$表示$bipartite\ Kneser\ graph$,即以$[n] = \{1, 2, ... , n\}$的$k$ -子集族和($n-k$)-子集族为顶点的图,其中任意两个顶点相邻当且仅当它们中的一个是另一个的子集。本文确定了$H(n, k)$的自同构群。证明了$Aut(H(n, k))\cong Sym([n]) \times \mathbb{Z}_2$,其中$\mathbb{Z}_2$是$2$阶循环群.然后,作为所得结果的应用,给出了确定Kneser图$K(n,k)$的自同构群的一个新的证明.事实上,我们展示了如何确定自同构群的Kneser图$K(n,k)$给定的自同构群的约翰逊图$J(n,k)$。注意,用于确定Johnson图$J(n,k)$和Kneser图$ K(n,k)$的自同构群的已知证明彼此独立。

英文摘要:

Let $n$ and $k$ be integers with $n>2k, k\geq1$. We denote by $H(n, k)$ the $bipartite\ Kneser\ graph$, that is, a graph with the family of $k$-subsets and ($n-k$)-subsets of $[n] = \{1, 2, ... , n\}$ as vertices, in which any two vertices are adjacent if and only if one of them is a subset of the other. In this paper, we determine the automorphism group of $H(n, k)$. We show that $Aut(H(n, k))\cong Sym([n]) \times \mathbb{Z}_2$ where $\mathbb{Z}_2$ is the cyclic group of order $2$. Then, as an application of the obtained result, we give a new proof for determining the automorphism group of the Kneser graph $K(n,k)$. In fact we show how to determine the automorphism group of the Kneser graph $K(n,k)$ given the automorphism group of the Johnson graph $J(n,k)$. Note that the known proofs for determining the automorphism groups of Johnson graph $J(n,k)$ and Kneser graph $ K(n,k)$ are independent from each other.

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

↑