Edge pancyclic derangement graphs

arXiv2207.06466MaRDI QIDQ6404907FDOQ6404907

Authors: Zequn Lv, Mengyu Cao, Mei Lu 

Publication date: 13 July 2022

Abstract: 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 $nge4$.

This page was built for publication: Edge pancyclic derangement graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404907)