TITLE:
New Results on One Modulo N-Difference Mean Graphs
AUTHORS:
Pon Jeyanthi, Meganathan Selvi, Damodaran Ramya
KEYWORDS:
Skolem Difference Mean Labeling, One Modulo N-Graceful Labeling, One Modulo N-Difference Mean Labeling and One Modulo N-Difference Mean Graph
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.13 No.4,
October
24,
2023
ABSTRACT: A graph G is said to be one modulo N-difference mean graph if there is an
injective function f from the vertex
set of G to the set
, where N is the natural number and q is the number of edges of G and f induces
a bijection from the edge set of G to given by and the function f is called a one modulo N-difference
mean labeling of G. In this paper, we
show that the graphs such as arbitrary union of paths, , ladder, slanting ladder, diamond snake, quadrilateral snake,
alternately quadrilateral snake, , , , , friendship graph and
admit one modulo
N-difference mean labeling.