$2n$-Cyclic Blended Labeling of Graphs

Abstract

We develop a new type of a vertex labeling of graphs, namely $2n$-cyclic blended labeling, which is a generalization of some previously known labelings. We prove that a graph with this labeling factorizes the complete graph on $2nk$ vertices, where $k$ is odd and $n,k>1$.