PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS
Abstract
Let be a graph with vertices and edges. Define and . Consider a mapping by assigning different labels in to the different elements of when is even and different labels in to elements of V and repeating a label for the remaining one vertex when is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge of G, there exists a labeling if is even and if is odd such that | |≤1 where and respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there is a pair mean cordial labeling is called pair mean cordial graph(PMC-graph). In this paper, we investigate the pair mean cordial labeling of some graphs like hurdle graph, lotus graph, necklace graph, F-tree, Y-tree, subdivided shell graph, uniform bow graph and key graph.
Downloads
References
F. Harary, Graph Theory. New Delhi: Narosa Publishing House, 1988.
A. Rosa, “On certain valuations of the vertices of a graph,” Theory of Graphs (Internat. Symposium, Rome, July 1966), pp. 349–355, 1967.
A. Gallian, “A Dynamic Survey of Graph Labeling,” Electron J Comb, vol. 18, pp. 1–219, 2011.
S. Somasundaram and R. Ponraj, “Mean labeling of graphs ,” National Academy Science Letter, vol. 26, pp. 210–213, 2003.
K. E. Hilda and J. J. Jesintha, “Subdivided Shell Flower Graphs: ρ- Labeling,” South East Asian J. of Math. & Math. Sci., vol. 14, no. 3, pp. 79–88, 2018.
J. J. Jesintha and K. E. Hilda, “All Uniform Bow Graphs are Graceful,” Mathematics in Computer Science, vol. 9, no. 2, pp. 185–191, Jun. 2015, doi: 10.1007/s11786-015-0224-2.
Dr. S. Nagarajan and G. Priyadharsini, “Lucky Edge Labeling of New Graphs,” International Journal of Mathematics Trends and Technology, vol. 67, no. 8, pp. 26–30, Aug. 2019, doi: 10.14445/22315373/IJMTT-V65I8P505.
J.-B. Liu, Z. Zahid, R. Nasir, and W. Nazeer, “Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph,” Mathematics, vol. 6, no. 11, p. 243, Nov. 2018, doi: 10.3390/math6110243.
V. S. Philomena and K. Thirusangu, “Square and cube difference labeling of cycle cactus, special tree and a new key graphs,” Annals of Pure and Applied Mathematics, vol. 8, no. 2, pp. 115–121, 2014.
K. Sunitha, Dr. C. D. Raj, and A. Subramanian, “Radio labeling of Hurdle graph and Biregular rooted Trees,” IOSR Journal of Mathematics (IOSR-JM), vol. 13, no. 5, pp. 37–44, Oct. 2017.
L. Vennila and P. Vidhyarani, “Skolem Difference Odd Geometric Mean Labeling of Path and Cycle Related Graphs,” J Algebr Stat, vol. 13, no. 3, pp. 1490–1493, 2022, [Online]. Available: https://publishoa.com
I. Cahit, “Cordial Graphs: A weaker version of Graceful and Harmonious Graphs,” Ars comb., vol. 23, pp. 201–207, 1987.
N. Inayah, A. Erfanian, and M. Korivand, “Total Product and Total Edge Product Cordial Labelings of Dragonfly Graph (Dg n ),” Journal of Mathematics, vol. 2022, no. 1, Jan. 2022, doi: 10.1155/2022/3728344.
A. Petrano and R. Rulete, “On total product cordial labeling of some graphs,” Internat. J. Math. Appl., vol. 5, no. 2B, pp. 273–284, 2017.
Ariel C. Pedrano and Ricky F. Rulete, “On the total product cordial labeling on the cartesian product of $P_m times C_n$, $C_m times C_n$ and the generalized Petersen graph $P(m, n)$,” Malaya Journal of Matematik, vol. 5, no. 03, pp. 531–539, Jul. 2017, doi: 10.26637/mjm503/007.
U. M. Prajapati and R. M. Gajjar, “Cordiality in the context of duplication in crown related graphs,” J. Math. Comput. Sci., vol. 6, no. 6, pp. 1058–1073, 2016.
U. M. Prajapati and R. M. Gajjar, “Cordial labeling of complement of some graph,” Mathematics Today, vol. 30, pp. 99–118, 2015.
U. Prajapati, S. Xavier’, U. M. Prajapati, and S. J. Gajjar, “Prime Cordial Labeling of Generalized Prism Graph,” 2015. [Online]. Available: https://www.researchgate.net/publication/329626528
R. Ponraj, A. Gayathri, and S. Somasundaram, “Pair difference cordial labeling of graphs,” J. Math. Comput. Sci., vol. 11, no. 3, pp. 2551–2567, 2021.
M. A. Seoud and A. A. Maqsoud, “On cordial and balanced labelings of graphs,” J. Egyptian Math. Soc, vol. 7, no. 1, pp. 127–135, 1999.
R. Ponraj and S. Prabhu, “Pair mean cordial labeling of graphs,” Journal of Algorithms and Computation, vol. 54, no. 1, pp. 1–10, 2022, [Online]. Available: http://jac.ut.ac.ir
R. Ponraj and S. Prabhu, “Pair Mean Cordiality of Some Snake Graphs,” Global Journal of Pure and Applied Mathematics, vol. 18, no. 1, pp. 283–295, 2022, [Online]. Available: http://www.ripublication.com/gjpam.htm
R. Ponraj and S. Prabhu, “Pair Mean Cordial labeling of some corona graphs,” Journal of Indian Acad. Math, vol. 44, pp. 45–54, 2022.
R. Ponraj and S. Prabhu, “PAIR MEAN CORDIAL LABELING OF GRAPHS OBTAINED FROM PATH AND CYCLE,” J. Appl. & Pure Math, vol. 4, no. 4, pp. 85–97, 2022, doi: 10.23091/japm.2022.085.
R. Ponraj and S. Prabhu, “ON PAIR MEAN CORDIAL GRAPHS,” J. Appl. & Pure Math, vol. 5, no. 4, pp. 237–253, 2023, doi: 10.23091/japm.2023.237.
Copyright (c) 2024 R Ponraj, S Prabhu
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this Journal agree to the following terms:
- Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
- Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
- Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.
1.gif)
