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

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*) [right arrow] {2, 4, 6,..., 2n} such that each e =...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 14; no. 3; p. 1038
Main Authors Sharma, Vishally, Parthiban, A
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.01.2024
Elman Hasanoglu
Subjects
Analysis
Apexes
Division
Graph theory
Graphs
Labeling
Labels
Mathematics
Methods
Number theory
India
Online AccessGet full text

Cover

More Information
Summary: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*) [right arrow] {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. Keywords: Graph labeling, average even divisor cordial labeling, square grid, Corona. AMS Subject Classification: 05C78.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2146-1147
2146-1147