G G G with |V V V(G G G)| = n n n is optimal if it has the minimum number of edges among all n n n-node k k k-Hamiltonian graphs. Using the concept of node expansion, we present a powerful construction scheme to construct a larger combined k k k-Hamiltonian graph from a given smaller graph. Many previous graphs can be constructed by the concept of node expansion. We also show that our construction maintains the optimality property in most cases. The classes of optimal combined k k k-Hamiltonian graphs that we constructed are shown to have a very good diameter. In particular, those optimal combined 1-Hamiltonian graphs that we constructed have a much smaller diameter than that of those constructed previously by Mukhopadhyaya and Sinha, Harary and Hayes, and Wang et al.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.