Labeling a kind of Cubic Graphs by Subgraph Embedding Method

Abstract

Based on a problem raised by Gao et. al. (Bull. Malays. Math. Sci. Soc., 41 (2018) 443–453.), we construct a family of cubic graphs which are double-edge blow-up of ladder graphs. We determine the full friendly index sets of these cubic graphs by embedding labeling graph method. At the same time, the corresponding labeling graphs are provided.