Product and Edge Product Cordial Labeling of Degree Splitting Graph of Some Graphs

Edge product cordial labeling of some graphs

“…In 2012, Vaidya and Barasara [5] introduced the concept of edge product cordial labeling as an edge analogue of the product cordial labeling in which they have investigated that the following graphs are edge product cordial: C n for n odd; trees with order greater than 2; unicyclic graphs of odd order; crown C n K 1 ; armed crowns C m P n ; helms; closed helms; webs; flowers; gears G n and shells S n for odd n. They also proved that the following graphs are not edge product cordial: C n for n even; wheels; shells S n for even n. Vaidya and Barasara [6] discussed edge product cordial labeling for some snake related 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.…”