A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

A divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V to {1,
2, 3,...| V|} such that an edge uv is assigned the label 1 if f (u) divides f (v) or f (v) divides f (u) …

A mapping f from the vertex set of a graph G to the set {0, 1, 2} is called 3-equitable labeling,
if the edge labels are produced by the absolute difference of labels of end vertices such that …

The concept of H− cordial graphs is introduced by Ibrahim Cahit in 1996. Ibrahim Cahit used
the symbol H to represent Hadamard Matrices. He claims that H− cordial graphs can be …

A subset cordial labeling of a graph G with vertex set V is an injection f from V to the power
set of {1, 2,..., n} such that an edge uv is assigned the label 1 if eitherf (u) is a subset of f (v) …

K. Palani et. al introduced the concept of prime mean labeling of graphs. Let 𝑮=(𝑽, 𝑬) be a
graph with 𝒑 vertices and 𝒒 edges. A graph 𝑮 is said to be a prime mean graph if there exist …

Let G be a simple (p, q) graph and let f: E (G)→{-1,+ 2,-3,..} be a mapping with the induced
labeling f*: V (G)→{0, 1} defined by f*(V)=∑ f (u+ v)/(u+ v∈ E (G)(mod 2) then f is called a …

E-CORDIAL LABELING OF SOME CLASS OF GRAPHS Page 1 NEUROQUANTOLOGY |
NOVEMBER 2022 | VOLUME 20 | ISSUE 15|PAGE 4080-4084| DOI: 10.14704/NQ.2022.20.15.NQ88410 …