数学理论与应用

• • 上一篇    下一篇

由单圈图生成的凯莱图的广义3-­连通度

王燕娜 1 ,周波 2,∗
  

  1. 1. 广东交通职业技术学院基础教学部, 广州, 510650;
    2. 华南师范大学数学科学学院, 广州, 510631
  • 出版日期:2022-06-28

The Generalized 3­connectivity of Cayley Graphs Generated by Unicyclic Graphs

Wang Yanna1,  Zhou Bo2,∗   

  1. 1. Basic Courses Department, Guangdong Communication Polytechnic, Guangzhou 510650, China;
    2. School of Mathematical Sciences, South China Normal University, Guangzhou 510631, China
  • Online:2022-06-28
  • Contact: Zhou Bo; E­mail: zhoubo@m.scnu.edu.cn
  • Supported by:
    This work is supported by the National Natural Science Foundation of China (Grant No. 12071158) and the Youth Innovative Talent
    Project of Guangdong Province of China (Grant No. 2020KQNCX160)

摘要: 设 $\mbox{Sym}(n)$ 是 $\{1,\dots,n\}$上的对称群, $\mathcal{T}$是 $\mbox{Sym}(n)$ 中的一些对换所成的集合. 设 $G(\mathcal{T})$ 是顶点集为 $\{1,\dots,n\}$的一个图,使得$ij$是$G(\mathcal{T})$ 的边当且仅当 对换$[i,j]$ 在$\mathcal{T}$中. 本文证明 当$n\geq 4$, $G(\mathcal{T})$ 是单圈图时, $\mbox{Sym}(n)$上 由$\mathcal{T}$生成的凯莱图的广义$3$-连通度为$n-1$.

关键词:

Abstract: Let $\mbox{Sym}(n)$ be the symmetric group on $\{1,\dots,n\}$ and $\mathcal{T}$ be a set of some transpositions of $\mbox{Sym}(n)$. Let $G(\mathcal{T})$ be the graph with vertex set $\{1,\dots,n\}$ such that there is an edge $ij$ in $G(\mathcal{T})$ if and only if the transposition $[i,j]\in\mathcal{T}$. In this paper we show that, for $n\geq 4$, the generalized $3$-connectivity of the Cayley graph on $\mbox{Sym}(n)$ generated by $\mathcal{T}$ is $n-1$ if $G(\mathcal{T})$ is any unicyclic graph.