AMGL Coding Technique on Felicitous Labeling of Braid Graphs and its Applications
Journal of Computational Mathematica · 30.06.2026 · 10 (1) · 39-56
DOI: 10.26524/cm225 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computational Mathematica, online erschienen am 30.06.2026. Verfasst von Leena S und 4 weiteren Autor:innen.
Abstract (Originalsprache)
Graph labeling plays a vital role in modern graph theory due to its wide range of applications in communications networks, cryptography, and coding theory. Among various labeling schemes, felicitous labeling is significant because of its modular arithmetic structure and uniqueness of edge labels. In this paper, the braid graph B(n) is studied under felicitous labeling and is further utilized for developing an efficient AMGL (Alphabets Maneuvered Graph Labeling) coding algorithm, and computational implementations are presented. Experimental results show that braid graphs provide a strong framework for secure message encoding and decoding. The study highlights the effectiveness of braid graphs in bridging mathematical theory with practical coding applications.
Zitieren
APA
S, L., V, S., LN, N., V, M., & V, B. (2026). AMGL Coding Technique on Felicitous Labeling of Braid Graphs and its Applications. Journal of Computational Mathematica, 10(1), 39-56. https://doi.org/10.26524/cm225
Vancouver
S L, V S, LN N, V M, V B. AMGL Coding Technique on Felicitous Labeling of Braid Graphs and its Applications. Journal of Computational Mathematica. 2026;10(1):39-56. doi:10.26524/cm225
BibTeX
@article{S2026,
author = {S, Leena and V, Sudhakar and LN, Narayanan and V, Malarvizhi and V, Balaji},
title = {AMGL Coding Technique on Felicitous Labeling of Braid Graphs and its Applications},
journal = {Journal of Computational Mathematica},
year = {2026},
volume = {10},
number = {1},
pages = {39--56},
doi = {10.26524/cm225}
}
EUVIMED