Graph product techniques for cordial labeling on cubic root graph structures
*J. SenbagamalarCorresponding authordrsenbagamalarj@veltech.edu.inDepartment of MathematicsAvadiVel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and TechnologyChennai, Tamil Nadu, 600062, IndiaView full profile → , D. Ramani Bairamanibai1987@gmail.comDepartment of MathematicsChevalier T. Thomas Elizabeth College for WomenChennai, Tamil Nadu, 600011, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Nov 2025
- Published Online:
- 04 Apr 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-2191
- Pages:
- 1479–1488
Abstract
Keywords
Subject Classifications
References
[1] R. Hammack, W. Imrich, and S. Klavžar, Handbook of Product Graphs. Boca Raton, FL, USA: Taylor & Francis, (2011).
[2] W. Imrich, S. Klavžar, and D. F. Rall, Topics in Graph Theory: Graphs and Their Cartesian Product. Natick, MA, USA: A K Peters, (2008).
[3] A. Kaveh and H. Rahami, “An efficient method for decomposition of regular structures using graph products,” Int. J. Numer. Methods Eng., vol. 61, no. 11, pp. 1797–1808, (2004).
[4] A. Kaveh and H. Rahami, “A unified method for eigen decomposition of graph products,” Commun. Numer. Methods Eng., vol. 21, no. 7, pp. 377–388, (2005).
[5] A. Kaveh, M. Nikbakht, and H. Rahami, “Improved group theoretic method using graph products for the analysis of symmetric-regular structures,” Acta Mech., vol. 210, no. 3–4, pp. 265–289, (2010).
[6] W. Imrich and H. Izbicki, “Associative products of graphs,” Monatsh. Math., vol. 80, pp. 277–281, (1975).
[7] G. Sabidussi, “Graph multiplication,” Math. Z., vol. 72, pp. 446–457, (1960).
[8] N. G. Gidheeba and A. Vijayan, “Root cube mean cordial labeling of some standard graphs,” Biosci. Biotechnol. Res. Commun., vol. 13, no. 15, pp. 330–337, (2020).
[9] C. Barrientos and S. Minion, “Broader families of cordial graphs,” Indones. J. Combinatorics, vol. 5, no. 1, pp. 46–62, (2021).
[10] S. S. Narayanan and M. Vijayaragavan, “Some 3-divisor cordial graphs derived from path,” Jordan J. Math. Stat., vol. 14, no. 2, pp. 335–350, (2021).
[11] S. Nada, A. Abd El-hay, and A. Elrokh, “Total cordial labeling of corona product of paths and second power of fan graph,” Turk. J. Comput. Math. Educ., vol. 13, no. 13, pp. 681–690, (2022).
[12] A. Abd El-hay, A. A. Khalid, and A. Elrokh, “A novel problem and algorithm for solving cordial labeling of some fifth powers of graphs,” Eur. J. Pure Appl. Math., vol. 18, no. 1, pp. 1–14, (2025).
[13] S. Nada, A. Elrokh, and A. Abd El-hay, “On signed product cordial of cone graph and its second power,” Turk. J. Comput. Math. Educ., vol. 13, pp. 597–606, (2022).
[14] A. Abd El-hay and A. Rabie, “Signed product cordial labeling of corona product between paths and second power of fan graphs,” Ital. J. Pure Appl. Math., vol. 48, pp. 287–294, (2022).
[15] W. Zhao, M. Naeem, and I. Ahmad, “Prime cordial labeling of generalized Petersen graph under some graph operations,” Symmetry, vol. 14, no. 4, pp. 1–22, (2022).
[16] M. Domingo and A. Racca, “Product cordial graph in the context of some graph operations on crown, helm, and wheel graph,” Int. Math. Forum, vol. 17, no. 2, pp. 89–104, (2022).
[17] A. D. Akwu and D. O. A. Ajayi, “Totally antimagic total labeling of ladders, prisms and generalised Petersen graphs,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 1, pp. 31–44, (2024).
[18] R. Boonklurb, N. Ruamkaew, and S. Singhun, “Directed edge-graceful labeling of digraph consisting of c cycles of the same size,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 1, pp. 53–72, (2022).
