Product Cordial Labelling for Some Bicyclic Graphs




Cordial labelling, Product cordial labelling, Bicyclic graph, Corona product


A graph \(G\) with lines and points is known as a product cordial graph if there occurs a labeling \(g\) from \(V(G)\) to \(\{0,1\}\) such that if every line \(rt\) is given the labeled \(g(r) .g(t)\), then the cardinality of points with labeled zero and the cardinality of points with labeled one vary as a maximum by one and the cardinality of lines with labeled zero and the cardinality of lines with labeled one vary by as a maximum one. In this case, \(g\) is alleged the product cordial labeling of \(G\). This paper deals with product cordial labeling for some graphs related to bicyclic graph such as \(B[n,n]\), \(B[n,n]*S_m\), \(B[n,n]*P_2*S_m\) and \(B[n,n]*P_3*S_m\), \(B[n,n] \odot K_2\), \(B[n,n] \odot K_3\).


Download data is not yet available.


J. A. Bondy and V. S. S. Murty, Graph Theory with Applications, North-Holland, New York (1976), URL:

G. Gajalakshmi and S. Meena, On odd prime labelings of snake related graphs, Journal of Algebraic Statistics 13(1) (2022), 630 – 634, URL:

J. A. Gallian, A dynamic survey of graph labelling (Graph Labelling), The Electronic Journal of Combinatorics DS6, Version 25 (2022), 623 pages, DOI: 10.37236/27.

Z.-B. Gao, G.-Y. Sun, Y.-N. Zhang, Y. Meng and G.-C. Lau, Product cordial and total product cordial labelings of Pmn+1, Journal of Discrete Mathematics 2015 (2015), DOI: 10.1155/2015/512696.

F. Harary, Graph Theory, Addison-Wesley, Reading, MA (1969).

S. Meena, G. Gajalakshmi and P. Kavitha, Prime labelling of h-super subdivision of cycle related graph, AIP Conference Proceedings 2516 (2022), 210051, DOI: 10.1063/5.0109588.

M. Sundaram, R. Ponraj and S. Somasundaram, Product cordial labeling of graphs, Bulletin of Pure and Applied Sciences, Mathematics and Statistics 23E (2004), 155 – 163.

D. B. West, Introduction to Graph Theory, Prentice Hall (1996), URL:




How to Cite

Meena, S., & Usharani, . S. (2022). Product Cordial Labelling for Some Bicyclic Graphs. Communications in Mathematics and Applications, 13(4), 1329–1336.



Research Article