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 …

Product Cordial Graphs in the Context of Some Graph Operations Page 1 INTERNATIONAL
JOURNAL OF MATHEMATICS AND SCIENTIFIC COMPUTING, VOL. 1, NO. 2, 2011 1 Product …

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 …

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 …

In this paper, we define the vertex product cordial labeling for some path related graphs like
P2 n, path union of k copies of P2 n graph and Pn⊙ K1. We also discuss vertex product …

This article proves the presence of signed product cordial labeling by double duplication of
all vertices by edges taking into consideration graph structures such as cycle graph, wheel …

Product cordial labeling of extensions of barbell graph Page 151 International J. Math. Combin.
Vol. 4 (2018), 146-159 Product Cordial Labeling of Extensions of Barbell Graph SK Patel1, UM …

Product Cordial Labeling of Some Cycle Related Graphs Page 1 ISSN(Online): 2319-8753
ISSN (Print): 2347-6710 International Journal of Innovative Research in Science, Engineering …