Product Cordial Labeling for Some New Graphs

Abstract

In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at diameter distance) are product cordial graphs. We also investigated middle graph of path P n admits product cordial labeling.

Some results on cordiality labeling of generalized Jahangir graph

“…Figure 4 shows the total product cordial labeling of graph J 4,5 . In [15,16], Vaidya and Barasara introduced an edge product cordial labeling and a total edge product cordial labeling of graph G. Thus, we propose the following problem.…”

On Vertex Product Cordial Labeling

“…Some labeling with variations in cordial labeling have been introduced such as prime cordial labeling, E-cordial labeling, product cordial labeling and total product cordial labeling. Cordiality behavior of numerous graph were studied by several authors [10,11,12,13]. The notion of product cordial labeling was introduced by Sundaram [10] in which the absolute difference in cordial labeling is replaced by product of the vertex labels.…”

Product cordial labeling of line graph of some graphs

“…Vaidya and Barasara [4][5][6][7][8] have also investigated many results on product cordial labeling. Definition 1.4.…”