A graph theoretic investigation of edge odd gracefulness in the family of Petersen graphs
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (4) · 1877-1881
DOI: 10.47974/jdmsc-2683 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von D. Senthil Kumar und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Solairaju and Chithra [2] presented the concept of edge odd graceful labeling (EOGL) for finite simple graphs. A graph is said to be EOGL if such a labeling exists a bijective mapping a function f from edge set to the set of odd integers from 1 to (2k – 1) so that every vertex is allocated, the total of the labeled edges incident to it mod 2k,are distinct. Here k is the maximum value among p vertices and q edges. The existence of EOGL for Family of Petersen graphs is shown in this work.
Zitieren
APA
Kumar, D. S., Lavanya, S. P., & Sugasini, M. (2026). A graph theoretic investigation of edge odd gracefulness in the family of Petersen graphs. Journal of Discrete Mathematical Sciences & Cryptography, 29(4), 1877-1881. https://doi.org/10.47974/jdmsc-2683
Vancouver
Kumar DS, Lavanya SP, Sugasini M. A graph theoretic investigation of edge odd gracefulness in the family of Petersen graphs. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(4):1877-1881. doi:10.47974/jdmsc-2683
BibTeX
@article{Kumar2026,
author = {Kumar, D. Senthil and Lavanya, S. P. and Sugasini, M.},
title = {A graph theoretic investigation of edge odd gracefulness in the family of Petersen graphs},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {4},
pages = {1877--1881},
doi = {10.47974/jdmsc-2683}
}
EUVIMED