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.
|Original language||English (US)|
|Number of pages||16|
|State||Published - Apr 2007|