Average even divisor cordial labeling: a new variant of divisior cordial labeling

Abstract

In the present paper, a new variant of divisor cordial labeling, named, an average even divisor cordial labeling, has been introduced. An average even divisor cordial labeling of a graph G* on n vertices, is defined by a bijective function g* : V (G*) → {2, 4, 6, ..., 2n} such that each e = ab is assigned label 1 if 2/g*(a)+g*(b) / 2, otherwise 0; then the difference of edges having labels 1 and 0 should not exceed by 1. A graph is called an average even divisor cordial graph if it admits to average even divisor cordial labeling. In this article, various general results of high interest are explored.