AVERAGE EVEN DIVISOR CORDIAL LABELING: A NEW VARIANT OF DIVISIOR CORDIAL LABELING

AVERAGE EVEN DIVISOR CORDIAL LABELING: A NEW VARIANT OF DIVISIOR CORDIAL LABELING

V. Sharma, A. Parthiban

[PDF]

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 di- visor cordial labeling of a graph G  on n vertices, is de ned by a bijective function g  : V (G ) ! f2; 4; 6; :::; 2ng such that each e = ab is assigned label 1 if 2= g (a)+g (b) 2 , otherwise 0; then the di erence 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.

Keywords

Graph labeling, average even divisor cordial labeling, square grid, Corona.