Some results in the study of compact mean labeling
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (4) · 1651-1660
DOI: 10.47974/jdmsc-2386 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von V. Maheswari und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Graph labeling is an essential concept that aims to provide a unique illustration for labeled graphs so that complex networks are easier to grasp for a real-time application. This study deals with theoretical backgrounds for a highly compact mean labeling; where under this approach, vertices are assigned labels from 0 to 2q – p. This approach is applicable for showcasing the potency of compact mean labeling over different categories of graphs, including complete, bipartite, snake, cycle, and wheel graphs. By using this technique, there is more enhanced visual access to the structure highlighted by graphs, hence allowing useful contributions to their properties and applications for solving problems in different areas. This shows the main importance of appropriate labeling in addressing real-life problems.
Zitieren
APA
Maheswari, V., Mary, A. S. R. T., & Balaji, V. (2026). Some results in the study of compact mean labeling. Journal of Discrete Mathematical Sciences & Cryptography, 29(4), 1651-1660. https://doi.org/10.47974/jdmsc-2386
Vancouver
Maheswari V, Mary ASRT, Balaji V. Some results in the study of compact mean labeling. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(4):1651-1660. doi:10.47974/jdmsc-2386
BibTeX
@article{Maheswari2026,
author = {Maheswari, V. and Mary, A. Sagaya Rose Tucilin and Balaji, V.},
title = {Some results in the study of compact mean labeling},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {4},
pages = {1651--1660},
doi = {10.47974/jdmsc-2386}
}
EUVIMED