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 …

Let f be a map from V (G) to {0, 1,···, k− 1} where k is an integer, 1≤ k≤| V (G)|. For each
edge uv assign the label f (u) f (v)(mod k). f is called a k-product cordial labeling if| vf (i)− vf …

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

We begin with a simple, finite, undirected graph()()(), G VGEG= where () VG and () EG
denote the vertex set and the edge set respectively. For all other terminology, we follow …

PRODUCT CORDIAL LABELING OF LINE GRAPH OF SOME GRAPHS 1. Introduction The
graph labeling is one of the concepts in graph theory Page 1 Kragujevac Journal of Mathematics …

Further results on product cordial labeling Page 69 Math. Combin. Book Ser. Vol. 3 (2012),
64-71 Further Results on Product Cordial Labeling SK Vaidya (Saurashtra University, Rajkot-360005 …

A graph is said to be a product cordial graph if there exists a function with each edge assign
the label, such that the number of vertices with label 0 and the number of vertices with label …

This paper deals with the palindromic labeling on some graphs related to H-graph. A
bijection f: V (G)→{1, 2,...,| V (G)|} is called palindromic labeling on graph G, if for every edge …

Abstract Let G=(V (G), E (G)) be a graph with V (G)= S< sub> 1</sub>∪ S< sub>
2</sub>∪···∪ S< sub> t</sub>∪ T, where each S< sub> i</sub> is a set of all the vertices …

A binary vertex labeling of graph G with induced edge labeling f∗: E (G)→{0, 1} defined by
f∗(e= uv)= f (u) f (v) is called a product cordial labeling if| vf (0)− vf (1)|≤ 1 and| ef (0)− ef …