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 …

In 2012, Ponraj et al. defined k-product cordial labeling as follows: 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) …

Product cordial labeling for alternate snake graphs Page 1 Malaya J. Mat. 2(3)(2014) 188–196
Product cordial labeling for alternate snake graphs SK Vaidyaa,∗ and NB Vyasb …

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 …

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 …

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 …

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 (j)|⩽ 1 …

For the graph G=(V (G), E (G)), a function f: V (G)→{0, 1} is called a product cordial labeling
of G if the induced edge labeling function defined by the product of end vertex labels be …

Teori graf merupakan bagian dari matematika diskrit yang banyak digu-nakan sebagai alat
bantu untuk menggambarkan suatu persoalan agar lebih mu-dah dimengerti. Beberapa …