完全二部图的朋友-陌生人图的连通性及其它
Connectedness of friends-and-strangers graphs of complete bipartite graphs and others
摘要:
设$X$和$Y$是任意两个阶为$n$的图。$X$和$Y$的朋友-陌生人图$\mathsf{FS}(X,Y)$是一个顶点集由所有双射$σ:V(X) \mapsto V(Y)$组成的图,其中两个双射$σ$,$σ'$相邻当且仅当它们在$X$的两个相邻顶点上恰好不同,并且相应的映射在$Y$中相邻.关于这些朋友-陌生人图,人们可以问的最基本的问题是它们是否是连通的。设$K_{k,n-k}$是$n$阶的完全二部图. 1974年,Wilson用代数方法刻画了$\mathsf{FS}(K_{1,n-1},Y)$的连通性。本文利用组合方法,研究了任意$Y$和所有$k\ge 2$(包括Defant和Kravitz提出的随机图$Y$)的$\mathsf{FS}(K_{k,n-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 $K_{k,n-k}$ be a complete bipartite graph of order $n$. In 1974, Wilson characterized the connectedness of $\mathsf{FS}(K_{1,n-1},Y)$ by using algebraic methods. In this paper, by using combinatorial methods, we investigate the connectedness of $\mathsf{FS}(K_{k,n-k},Y)$ for any $Y$ and all $k\ge 2$, including $Y$ being a random graph, as suggested by Defant and Kravitz, and pose some open problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。