Abstract

A graph 𝐺=(𝑉,𝐸) is called an absolute mean cordial graph if there exists a one-to-one function f from 𝑉(𝐺) to the set {0,±2,±4,…,±⌊𝑞2⌋} such that each edge 𝑢𝑣∈𝐸(𝐺) is assigned the label 1 when ⌈|𝑓(𝑢)−𝑓(𝑣)|2⌉≤⌈𝑞2⌉, and 0 otherwise, with the labeling satisfying the condition |𝑒𝑓(0)−𝑒𝑓(1)|≤1. In this paper, we investigate the join of several graphs that are absolute mean cordial graphs. We establish new results concerning absolute mean cordial graphs.

Keywords

Labeling, Cordial Labeling, Absolute Mean Cordial Labeling, Sunflower Graph, Helm graph.

References

[1] P.Z. Akbari, J.C. Kanani, and V.J. Kaneria, “A Study on Absolute Mean Cordial Labeling of Various Graphs,” Educational Administration: Theory and Practice, vol. 29, no. 4, pp. 3094–3102, Dec. 2023.
[CrossRef] [Publisher Link]

[2] Z. Akbari, V.J. Kaneria, and N.A. Parmar, “Absolute Mean Graceful Labeling of Jewel Graph and Jelly Fish Graph,” International Journal of Mathematics Trends and Technology, vol. 68, no. 1, pp. 86-93, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[3] P.Z. Akbari, V.J. Kaneria, and N.A. Parmar, “Some Mean Graceful Graphs in the Context of Barycentric Subdivision,” International Journal of Mathematics Trends and Technology, vol. 68, no. 5, pp. 51-60, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[4] I. Cahit, “Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs,” Ars Combinatoria, vol. 23, pp. 201-207, 1987.
[Google Scholar]

[5] Ibrahim Cahit, “On Cordial and 3‑Equitable Labelings of Graphs,” Utilitas Mathematica, vol. 37, pp. 129-137, 1990.
[Google Scholar] 

[6] Joseph A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronic Journal of Combinatorics, vol. 28, Article DS6, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[7] Solomon W. Golomb, “How to Number a Graph,” Graph Theory and Computing, Academic Press, pp. 23-37, 1972.
[CrossRef] [Google Scholar] [Google Scholar]

[8] F. Harary, Graph Theory, New Delhi, India: Narosa Publishing House, 2001.
[Google Scholar]

[9] J.C. Kanani, and H.P. Chudasama, “Absolute Mean Cordial Labeling,” Educational Administration: Theory and Practice, vol. 29, no. 4, pp. 3119-3130, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[10] H.P. Chudasama, and V.J. Kaneria, “Absolute Mean Graceful Labeling in Path Union of Various Graphs,” Mathematical Journal of Interdisciplinary Sciences, vol. 7, no. 1, pp. 51–56, 2018.
[Google Scholar]

[11] A. Rosa, “On Certain Valuation of the Vertices of the Graph,” Theory of Graphs: International Symposium, Gordon and Breach, pp. 349-355, 1964.
[Google Scholar]

[12] S.K. Vaidya et al., “Cordial and 3‑Equitable Labeling for Some Shell Related Graphs,” Journal of Scientific Research, vol. 1, no. 3, pp. 438-449, 2009.
[CrossRef] [Google Scholar] [Google Scholar]