Back
 OJDM  Vol.6 No.4 , October 2016
Some Edge Product Cordial Graphs in the Context of Duplication of Some Graph Elements
Abstract: For a graph, a function is called an edge product cordial labeling of G, if the induced vertex labeling function is defined by the product of the labels of the incident edges as such that the number of edges with label 1 and the number of edges with label 0 differ by at most 1 and the number of vertices with label 1 and the number of vertices with label 0 differ by at most 1. In this paper, we show that the graphs obtained by duplication of a vertex, duplication of a vertex by an edge or duplication of an edge by a vertex in a crown graph are edge product cordial. Moreover, we show that the graph obtained by duplication of each of the vertices of degree three by an edge in a gear graph is edge product cordial. We also show that the graph obtained by duplication of each of the pendent vertices by a new vertex in a helm graph is edge product cordial.
Cite this paper: Prajapati, U. and Shah, P. (2016) Some Edge Product Cordial Graphs in the Context of Duplication of Some Graph Elements. Open Journal of Discrete Mathematics, 6, 248-258. doi: 10.4236/ojdm.2016.64021.
References

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

[2]   Vaidya, S.K. and Barasara, C.M. (2012) Edge Product Cordial Labeling of Graphs. Journal of Mathematics and Computer Science, 2, 1436-1450.
http://scik.org/index.php/jmcs/article/view/420/189

[3]   Vaidya, S.K. and Barasara, C.M. (2013) Some New Families of Edge Product Cordial Graphs. Advanced Modeling Optimization, 15, 103-111.
http://camo.ici.ro/journal/vol15/v15a9.pdf

[4]   Vaidya, S.K. and Barasara, C.M. (2011) Product Cordial Graphs in the Context of Some Graph Operations. International Journal of Mathematics and Computer Science, 1, 1-6.

[5]   Vaidya, S.K. and Dani, N.A. (2011) Cordial and 3-Equitable Graphs Induced by Duplication of Edge. Mathematics Today, 27, 71-82.

 
 
Top