Edge product cordial labeling on duplication of prism graph ∗
DOI:
https://doi.org/10.48165/Keywords:
Cordial graph, Product cordial graph, Edge product cordial graph, Prism graph, Web graph, Duplication of vertex by edgeAbstract
For a graph G =(V(G), E(G)), an edge labeling function f: E (G) → {0,1} induces a vertex labeling function f *:V(G) → {0,1} such that f *(v) is the product of the labels of the edges incident to v. This function f is called the edge product cordial labeling of G if the edges with label 1 and label 0 differ by at most 1 and the vertices with label 1 and label 0 also differ at most by 1. In this paper, we obtain an edge product cordial labeling of the duplication of prism graph.
References
Cahit, I. (1987). Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin., 23, 201–207.
Gallian, J. (2017). A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 1–415.
Rosa, A. (1967). On certain valuations of the vertices of a graph, Theory of Graphs (International Symposium, Rome, July 1966), Gordon and Breach, N.Y. and Dunod Paris, 349ff-355. [4] Sampathkumar, E. (1973). On duplicate graphs, Journal of the Indian Math. Soc., 37, 285–293. [5] Sundaram, M., Ponraj, R. and Somasundaram, S. (2004). Product cordial labeling of graphs, Bull. Pure Appl. Sci. Sect. E Math. Stat., 23, 155–163.
Vaidya, S.K and Barasara, C.M. (2012). Edge product cordial labeling of graphs, J. Math. Comput. Sci., 2(5), 1436–1450.
Vaidya, S.K and Barasara, C.M. (2013). Some new families of edge product cordial graphs, Ad vanced Modeling Optimization, 15(1), 103–111.
J. Jeba Jesintha, D. Devakirubanithi and L. Monisha
Vaidya, S.K. and Barasara, C.M. (2012). Further results on product cordial graphs, International
Journal of Mathematics and Soft Computing, 2(2), 67–74.
Vaidya, S.K. and Prajapathi, U.M. (2013). Prime labeling in the context of duplication of graph
elements, International Journal of Mathematics and Soft Computing, 3(1), 13–20.
Downloads
Published
Issue
Section
How to Cite
