Hamiltonicity of the Complete Double Vertex Graph of some Join Graphs
Combinatorics
2021-08-04 v1
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.
Cite
@article{arxiv.2108.01119,
title = {Hamiltonicity of the Complete Double Vertex Graph of some Join Graphs},
author = {Luis Manuel Rivera and Ana Laura Trujillo-Negrete},
journal= {arXiv preprint arXiv:2108.01119},
year = {2021}
}
Comments
8 pages, 1 figure. The results presented in this article were presented in preprint arXiv:2007.00115 which was splitted into two papers