A Special Class of Product Cordial Labeling Graphs

admin August 13, 2019

Authors:

G. Subashini,K. Manimekalai,K. Bhuvaneswari,

DOI NO:

https://doi.org/10.26782/jmcms.spl.2019.08.00078

Keywords:

Duplication of a vertex by an edge,Product Cordial Labeling (PCL),Product Cordial Graphs (PCG),

Abstract

In this work we study that D(k1,n), D(Bn,n) and D(Cn ʘ K1), n  3 admits product cordial labeling.

Refference:

I. Frank Harary, Graph theory, Narosa Publishing House, 2001.
II. Gallian. J.A, A dynamic
Combinatories, 17 (2010) #DS6.
III. Rosa A, On certain valuation of graph theory of graphs (Rome, July 1966),
Golden and Breach, N.Y and Paris (1967), 349
IV. Sugumaran, K. Suresh, A special class of prime
Journal of Pure and Applied Mathematics, Vol. 114, No. 6, pp. 41
V. Sundaram. M, Ponraj. R and Somasundaram. S, Product Cordial Labeling of
Graphs, Bulletin of Pure and Applied Sciences. Vol. 23E(No.1) 2004, p. 155
163.
VI. Vaidya. S.K, C.M. Barasara, Product cordial graphs in the context of some
graphs operations, International Journal of Mathematics and Scientific
Computing, Vol. 1, pp. 1
Advancement in Engineering, Science & Technology
No.-2, August (2019) pp
646
D(C3 ʘ K1) shown below.
D(k1,n), D(Bn,n)and D(Cn ʘ K1) are product cordial
, survey of graph labeling, The electronics journal of
, 355.
cordial graphs, Internal
, 6, 2011.

View | Download