棒棒糖图的朋友-陌生人图的连通性及其它
The connectedness of the friends-and-strangers graph of lollipop graphs and others
摘要:
设$X$和$Y$是任意两个阶为$n$的图。$X$和$Y$的朋友-陌生人图$\mathsf{FS}(X,Y)$是一个顶点集由所有双射$σ:V(X) \mapsto V(Y)$组成的图,其中两个双射$σ$,$σ'$相邻当且仅当它们在$X$的两个相邻顶点上恰好不同,并且相应的映射在$Y$中相邻.关于这些朋友-陌生人图,人们可以问的最基本的问题是它们是否是连通的。设$\mathsf{Lollipop}_{n-k,k}$是一个$n$阶的棒棒糖图,它是通过用一个$k$阶的完全图的顶点来标识$n-k+1$阶的路的一端而得到的. Defant和Kravitz开始研究$\mathsf{FS}(\mathsf{Lollipop}_{n-k,k},Y)$的连通性。本文对所有的$2\leq k\leq n$给出了$\mathsf{FS}(\mathsf{Lollipop}_{n-k,k},Y)$连通的一个充要条件。
英文摘要:
Let $X$ and $Y$ be any two graphs of order $n$. The friends-and-strangers graph $\mathsf{FS}(X,Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $σ:V(X) \mapsto V(Y)$, in which two bijections $σ$, $σ'$ are adjacent if and only if they differ precisely on two adjacent vertices of $X$, and the corresponding mappings are adjacent in $Y$. The most fundamental question that one can ask about these friends-and-strangers graphs is whether or not they are connected. Let $\mathsf{Lollipop}_{n-k,k}$ be a lollipop graph of order $n$ obtained by identifying one end of a path of order $n-k+1$ with a vertex of a complete graph of order $k$. Defant and Kravitz started to study the connectedness of $\mathsf{FS}(\mathsf{Lollipop}_{n-k,k},Y)$. In this paper, we give a sufficient and necessary condition for $\mathsf{FS}(\mathsf{Lollipop}_{n-k,k},Y)$ to be connected for all $2\leq k\leq n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。