Hamiltonicity of the Complete Double Vertex Graph of some Join Graphs
arXiv:2108.01119
Abstract
The complete double vertex graph of is defined as the graph whose vertices are the -multisubsets of , and two of such vertices are adjacent in if their symmetric difference (as multisets) is a pair of adjacent vertices in . In this paper we exhibit an infinite family of graphs (containing Hamiltonian and non-Hamiltonian graphs) for which are Hamiltonian.
8 pages, 1 figure. The results presented in this article were presented in preprint arXiv:2007.00115 which was splitted into two papers