Packing of Any Set of Graphs Into a Graceful/ Harmonious / Elegant Graph

Abstract

Balakrishnan et al. \([1, 2]\) have shown that every graph is a subgraph of a graceful graph and an elegant graph. Also Liu and Zhang \([4]\) have shown that every graph is a subgraph of a harmonious graph. In this paper we prove a generalization of these two results that any given set of graphs \(G_1,G_1,\ldots,G_i\) can be packed into a graceful/harmonious/elegant graph.