Edge Product Cordial Labeling of Some Cycle Related Graphs

Abstract

For a graph () () () , G V G E G = having no isolated vertex, a function

Pair Difference Cordial Labeling of Certain Broken Wheel Graphs

“…In 1980, Cahit introduced the cordial labeling of graphs in [1]. In the sequal several cordial related labeling was studied in [13,14,15,16,18,19,20,21,22]. Ponraj et al introduced the pair difference cordial labeling in [4].…”

Pair Difference Cordiality of Mirror Graph,shadow Graph and Splitting Graph of Certain Graphs

“…The origin of graph labeling is graceful labeling and introduced this concept by Rosa.A [15].Afterwards many labeling was defined and few of them are harmonious labeling [7], cordial labeling [1], magic labeling [16], mean labeling [19]. Cordial analogous labeling was studied in [2,3,4,5,10,11,12,13,14,17,18]. The notion of pair diference cordial labeling of a graph has been introduced and studied some properties of pair difference cordial labeling in [9].The pair difference cordial labeling behavior of several graphs like path, cycle, star etc have been investigated in [9].In this paper we dicuss the pair difference cordility of Mirror graph,Splitting graph,Shadow graph of some graphs.Term not defined here follow from Harary [8].…”

Edge product cordial labeling of some graphs

“…In [7], Vaidya and Barasara discussed product and edge product cordial labelings of the degree splitting graphs of paths, shells, bistars, and gear graphs. Prajapati and Patel [8] discussed edge product cordial labeling of some cycle related graphs.…”