2000 character limit reached
Hamiltonicity of the Complete Double Vertex Graph of some Join Graphs
Published 2 Aug 2021 in math.CO | (2108.01119v1)
Abstract: The complete double vertex graph $M_2(G)$ of $G$ is defined as the graph whose vertices are the $2$-multisubsets of $V(G)$, and two of such vertices are adjacent in $M_2(G)$ if their symmetric difference (as multisets) is a pair of adjacent vertices in $G$. In this paper we exhibit an infinite family of graphs $G$ (containing Hamiltonian and non-Hamiltonian graphs) for which $M_2(G)$ are Hamiltonian.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.