论文标题
边缘之前的危险图
Edge pancyclic derangement graphs
论文作者
论文摘要
我们考虑了顶点为$ \ {1，\ ldots，n \} $的置换图。如果相应的排列在每个位置不同，则两个顶点与边缘连接。危机图是哈密顿式的，汉密尔顿相关。在本说明中，我们表明，如果$ n \ ge 4 $，扰动图是边缘的。
We consider the derangement graph in which the vertices are permutations of $\{ 1,\ldots, n\}$. Two vertices are joined by an edge if the corresponding permutations differ in every position. The derangement graph is known to be Hamiltonian and Hamilton-connected. In this note, we show that the derangement graph is edge pancyclic if $n\ge 4$.
