Open Access
Research Article
Edge-odd graceful labeling of Cartesian product of two paths
*D. Senthil KumarCorresponding authorzenthil29@gmail.comDepartment of Mathematics Takshashila University Ongur TindivanamDepartment of Mathematics Takshashila University TindivanamVilluuram District, Tamil Nadu, 604001, India0000-0003-2719-3300View full profile → , R. Anbarasanabianbu009@gmail.comDepartment of Mathematics Mailam Engineering CollegeMailam, Tamil Nadu, 604304, IndiaView full profile → , G. Pushparajpushgovindan@gmail.comDepartment of Mathematics Mailam Engineering CollegeMailam, Tamil Nadu, 604304, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 08 Feb 2022
- Accepted:
- 09 Nov 2022
- Published Online:
- 01 Apr 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1322
- Pages:
- 591–599
Abstract
Let G be a finite simple graph with p vertices and q edges is called an edge odd graceful labeling if there exists a bijective map f : E(G) → {1, 2, 3, ..., (2k – 1)} such that when each vertex is assigned, the sum of all edges incident to it mod 2k, where k = max(p,q), the resulting vertex labels are distinct. Any (p,q) - graph admitting edge - odd graceful labeling is called an edge-odd graceful graph. In this paper, we investigate the existence of edge odd graceful labeling for the cartesian product of two paths Pm and Pn where m and n are any positive integers.
Keywords
Subject Classifications
05C78
References
[1] Mohammad Basher, “Odd-even graceful labeling of planar grid and prism graphs,” Journal of Information Optimization Science, pp. 1–6 (2020).[2] Gary Chartrand and Linda Lesniak, Graphs and Digraphs, 4th ed. Boca Raton, FL: Chapman and Hall/CRC (2005).[3] Salem N. Daoud, “Edge odd graceful labeling of some path and cycle related graphs,” AKCE International Journal of Graphs and Combinatorics, vol. 14, pp. 178–203 (2017).[4] David Kuo and Jing-Ho Yan, “On L(2,1)-labelings of Cartesian products of paths and cycles,” Discrete Mathematics, vol. 283, pp. 137–144 (2004).[5] Shih-Pin Lo, “On edge-graceful labeling of graphs,” Congressus Numerantium, vol. 50, pp. 231–241 (1985).[6] A. Rosa, “On certain valuations of the vertices of a graph,” in Theory of Graphs, Internat. Symp., Rome, Italy, July 1966, Gordan and Breach, New York and Paris, pp. 349–355 (1967).[7] A. Solairaju and K. Chithra, “Edge-odd graceful labeling of some graphs,” Proceedings of the ICMCS Bulletin of the ICA, vol. 1, pp. 101–107 (2008).[8] A. Solairaju and D. Senthil Kumar, “Edge-Odd Gracefulness of Graphs [P3 ◊ Pn], [P3 ◊ 2Pn], [C3 ◊ Pn], [C3 ◊ 2Pn], [P3 ◊ Pn], [P3 ◊ 2Pn], [C3 ◊ Pn], and [C3 ◊ 2Pn],” Global Journal of Pure and Applied Mathematics, vol. 11, pp. 129–137 (2015).[9] Joseph A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronic Journal of Combinatorics, vol. 17 (2010).
Views: 282Downloads: 9Citations: 0
