Edge pancyclic derangement graphs
Combinatorics
2022-07-15 v1
Abstract
We consider the derangement graph in which the vertices are permutations of . 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 .
Keywords
Cite
@article{arxiv.2207.06466,
title = {Edge pancyclic derangement graphs},
author = {Zequn Lv and Mengyu Cao and Mei Lu},
journal= {arXiv preprint arXiv:2207.06466},
year = {2022}
}
Comments
7 pages, 1 figure