Extensions of product cordial graph labeling using MATLAB
Varsha Rathi2022401996.varsha@dr.sharda.ac.inDepartment of Mathematics & Data ScienceSharda School of Engineering & ScienceSharda UniversityGreater Noida, Uttar Pradesh, 201310, IndiaView full profile → , Sweta Srivastavsweta.srivastav@sharda.ac.inDepartment of Mathematics & Data ScienceSharda School of Engineering & ScienceSharda UniversityGreater Noida, Uttar Pradesh, 201310, IndiaView full profile → , Sangeeta Guptasangeeta.gupta@sharda.ac.inDepartment of Mathematics & Data ScienceSharda School of Engineering & ScienceSharda UniversityGreater Noida, Uttar Pradesh, 201310, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Jan 2026
- Published Online:
- 30 Sep 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2803
- Pages:
- 3341–3352
Abstract
Graph labeling is a widely studied area in graph theory with applications in computer science, network analysis, and algorithmic modeling. A binary vertex labeling function f : α(G) to {0, 1}, causes the labeling of an edge f : β(G) → {0, 1} as determined by f (ty) = f(t) f(y). If the number of vertices differs, this labeling is referred to as a product cordial labeling (respectively, edges) labeled with 0 and 1 does not exceed one. In this work, we extend the study of product cordial labeling using MATLAB programming. We construct and verify product cordial labelings for three classes of graphs: (i) number of copies of the shell graphs, (ii) the star structure of concentric n-sunlet graphs, and (iii) number of the copies of concentric n-sunlet graphs. The proposed MATLAB implementations provide an algorithmic approach to generate these graphs, assign labels, and validate the cordiality conditions. This computational perspective not only confirms theoretical results but also demonstrates the utility of MATLAB for investigating new extensions of product cordial graphs.
Keywords
Subject Classifications
References
[1] I. Cahit, “A short proof of Groetzsch’s three color theorem,” (1958).
[2] I. Cahit, “Cordial graphs—a weaker version of graceful and harmonious graphs,” Ars Combinatoria, vol. 23, pp. 201–207 (1987).
[3] J. A. Gallian, “Graph Labeling,” The Electronic Journal of Combinatorics, Dynamic Surveys, DS6, (1998), doi: 10.37236/27.
[4] S. Meena, M. Renugha, and M. Sivasakthi, “Cordial labeling for different types of shell graph,” International Journal of Scientific and Engineering Research, vol. 6, no. 9, pp. 1282–1288 (2015).
[5] U. M. Prajapati and K. K. Raval, “Some graphs in the context of product cordial labeling,” Mathematics Today, vol. 33, pp. 58–66 (2017).
[6] A. H. Rokad, “Product cordial labeling of double wheel and double fan related graphs,” Kragujevac Journal of Mathematics, vol. 43, no. 1, pp. 7–13 (2019).
[7] M. Sundaram, R. Ponraj, and S. Somasundaram, “Product cordial labeling of graphs,” Bulletin of Pure and Applied Sciences (Mathematics & Statistics), vol. 23E, pp. 155–163 (2004).
[8] S. K. Vaidya and N. B. Vyas, “Product cordial labeling in the context of tensor product of graphs,” Journal of Mathematics Research, vol. 3, no. 3, pp. 83–88 (2011).
[9] S. K. Vaidya and C. M. Barasara, “Product cordial labeling for some new graphs,” Journal of Mathematics Research, vol. 3, no. 2, pp. 206–211 (2011).
[10] S. K. Vaidya and N. A. Dani, “Some new product cordial graphs,” Journal of Applied Computer Science & Mathematics, vol. 8, no. 4, pp. 62–65 (2010).
[11] S. K. Vaidya and K. K. Kanani, “Some cycle related product cordial graphs,” International Journal of Algorithms, Computing and Mathematics, vol. 3, no. 1, pp. 109–116 (2010).
[12] M. R. Zeen El Deen and G. M. Elmahdy, “Different types of odd harmonious labeling of super subdivision of various graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 8, pp. 2373–2407 (2024), doi: 10.47974/JDMSC-1945.
[13] N. U. Sivaranjani, E. Nandakumar, G. Mittal, and R. K. Sharma, “The structure of the unit group of the group algebra KqSL(2, Z7),” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 8, pp. 2461–2472 (2024).
