Senadeera, A.T.Fernando, C.L.R.Perera, A.A.I.2025-11-202025-11-202025-07-04Proceedings International Conference on mathematics and Mathematics Education(ICMME) -2025, University of Peradeniya, P 36978-624-5709-03-8https://ir.lib.pdn.ac.lk/handle/20.500.14444/6865Graph labelling is the process of assigning integers to the vertices, edges, or both, under specific constraints. In 1987, Ibrahim Cahit introduced cordial labelling as a more flexible alternative to graceful and harmonious labellings. A specialized form, product cordial labelling, was later introduced by R. Ponraj, M. Sivakumar, and M. Sundaram in 2012, leading to further research on different classes of graphs that exhibit this property. Product cordial labelling is defined as a function ƒ: V(G) → {0,1}, where each edge uv is assigned the label ƒ(u)ƒ(v). A graph is said to be product cordial if the absolute difference between the number of vertices labeled 0 and 1 is at most 1, and the absolute difference between the number of edges labeled 0 and 1 does not exceed 1. This labelling method provides insights into graph structures and their combinatorial properties, making it a useful tool in network theory, coding, and other applied fields. In this study, the existence of product cordial labelling for helm graphs H(n), obtained by attaching a pendant edge to each vertex of the cycle in an n-wheel graph, is shown. A structured approach is presented for labelling these graphs based on whether the cycle has an odd or even number of vertices. Furthermore, this study extends the analysis to a generalized version of helm graphs, such as those with additional pendant attachments, and explores conditions under which these graphs maintain product cordiality. These findings contribute to the broader study of graph labellings and their applications in discrete mathematics and theoretical computer science.en-USCordial labellingHelm graphProduct cordial labellingWheel graphArticle