PMC-LABELING OF PRISM ALLIED GRAPH, PENDULUM GRAPH AND COG WHEEL GRAPH

Year 2025, Volume: 15 Issue: 11, 2664 - 2673, 03.11.2025

R Ponraj , S Prabhu

Abstract

In this paper, we investigate the PMC-labeling behavior of some graphs like pendulum graph, hexagonal circular ladder, cog wheel graph, triangular wheel graph, double crown-wheel graph, crown-triangular wheel graph, $H_{n,n}$, $P_{3}\times P_{n}$, prism allied graph and antiprism allied graph.

Keywords

pendulum graph , hexagonal circular ladder , cog wheel graph , triangular wheel graph , prism allied graph

References

• Aljohani, M. and Daoud, S. N., (2024), Edge odd graceful labeling in some wheel-related graphs, Mathematics, 12, 1203. https://doi.org/10.3390/math12081203.
• Cahit, I., (1987), Cordial graphs: a weaker versionof graceful and harmonious graphs, Ars combin., 23, 201-207.
• Gallian, J. A., (2023), A dynamic survey of graph labeling, The Electronic Journal of Combinatorics ,26.
• Harary, F., (1972), Graph theory, Addison Wesely, New Delhi.
• Ibrahim, M., Gulzar, A., Fazil, M., and Azhar, M. N., (2022), On edge H-irregularity strength of hexagonal and octagonal grid graphs, Hindawin J. Math., 2022 Article ID 6047926, 10 pages.
• Kumari, N., and Mehra, S., (2017), On vertex product cordial labeling, Internat. J. Pure Appl. Math.,114(3), 553-570.
• Kusbudiono, Uman, I. A., Halikin, I., and Fatekurohman, M., (2021), L(2,1) labeling of lollipop and pendulum graphs, Advances in Computer Science Research, Vol. 96, 44-47.
• Nabila, S., and Salman, A. N. M., (2015), The rainbow connection number of origami graphs and pizza graphs, Procedia Computer Science 74, 162-167.
• Ponraj, R., and Prabhu, S., (2022), Pair mean cordial labeling of graphs, Journal of Algorithms and Computation, 54 issue 1, 1-10.
• Ponraj, R., and Prabhu, S., (2022), Pair mean cordial labeling of graphs obtained from path and cycle, Journal of Applied and Pure Mathematics, Vol 4 No. 3-4, 85-97.
• Ponraj, R., and Prabhu, S., (2023), On pair mean cordial graphs, J. Appl. & Pure Math., Vol. 5 No. 3-4, 237-253.
• Prajapati, U. M., and Gajjar, S. J., (2015), Prime cordial labeling of generalized prism graph Ym,n, Ultra Scientist, 27(3)A, 189-204.
• Prajapati, U. M., and Patel, N. B., (2019), Edge product cordial labeling of some graphs, J. Appl. Math. Comput. Mech., 18(1), 69-76.
• Rosa, A., (1967), On certain valuations of the vertices of a graph, Theory of Graphs (Intl. Symp. Rome 1966), Gordon and Breach, Dunod, Paris, 349-355.
• Sharma, S. K., and Bhat, V. K., (2023), On vertex edge resolvability for the web graph and prism related graph, Ars Combinatoria, 157, 95-108.
• Susanti, Y., Ernanto, I., and Surodjo, B., (2019), On some new edge odd graceful graphs, AIP Conf. Proc. 2192, 04001601-04001612 . http://doi.org/10.1063/1.5139142.
• Seoud, M. A., and Helmi, E. F., (2011), On difference graphs, J. Combin. Math. and Combin. Comput. 76, 189-199.
• Seoud, M. A., and Salim, M. A., (2014), On mean graphs, Ars Combin., 115, 13-34.
• Seoud, M. A., and Jaber, H., (2019), Prime cordial and 3-equitable prime cordial graphs, Util. Math., 111, 95-125.