PRODUCT CORDIAL LABELING OF DOUBLE WHEEL RELATED GRAPHS
1S. Meena and 2S. Usharani*
1Associate Professor , PG & Research Department of Mathematics, Government Arts
College, Chidambaram, Tamil Nadu, India. E-mail: meenasaravanan14@gmail.com
2*Research Scholar, PG & Research Department of Mathematics, Government Arts
College, Chidambaram, Tamil Nadu, India. E-mail: usharanisrm@gmail.com
ABSTRACT
A graph is said to be a product cordial graph if there exists a mapping from to such that if each line is given the label , then the cardinality of points with value and the cardinality of points with value 1 differ at most by and the cardinality of lines with value and the cardinality of lines with value differ by at most In this case, is said to be a product cordial labelling of In this article, we find the product cordial labelling of double wheel related graphs and we prove that the graphs such as all are product cordial graphs.
Keywords and phrases: Cordial labeling, Product cordial labeling, Double wheel graph, Corona product.