Back
 OJDM  Vol.6 No.4 , October 2016
Edge Product Cordial Labeling of Some Cycle Related Graphs
Abstract: For a graph having no isolated vertex, a function is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and the number of edges with label 1 differ by at most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at most 1. In this paper, we discuss edge product cordial labeling for some cycle related graphs.
Cite this paper: Prajapati, U. and Patel, N. (2016) Edge Product Cordial Labeling of Some Cycle Related Graphs. Open Journal of Discrete Mathematics, 6, 268-278. doi: 10.4236/ojdm.2016.64023.
References

[1]   Gross, J.L. and Yellen, J. (Eds.) (2004) Handbook of Graph Theory. CRC Press, Boca Raton.

[2]   Gallian, J.A. (2014) A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 17, #DS6.
http://www.combinatorics.org

[3]   Vaidya, S.K. and Barasara, C.M. (2012) Edge Product Cordial Labeling of Graphs. Journal of Mathematical and computational Science, 2, 1436-1450.

[4]   Ponraj, R., Sathish Narayanan, S. and Kala, R. (2015) A Note on Difference Cordial Graphs. Palestine Journal of Mathematics, 4, 189-197.

[5]   Vaidya, S.K. and Prajapati, U.M. (2013) Prime Labeling in the Context of Duplication of Graph Elements. International Journal of Mathematics and Soft Computing, 3, 13-20.

 
 
Top