UNI-LABELING OF GRAPHS OVER FINITE COMMUTATIVE RINGS
UNI-LABELING OF GRAPHS
DOI :
https://doi.org/10.5269/bspm.80028Résumé
This paper introduces the notion of uni-labeling of a graph and its empirical study demonstrates that every finite graph admits a uni-labeling with respect to some finite commutative ring. In the course of the investigation, it is found that unit graph turns out to be maximal with respect to the optimal uni-labeling index. Furthermore, the paper determines the optimal uni-labeling index for several well-known families of graphs. Several new directions for further research are also indicated through problems.
Téléchargements
Publié
2026-02-04
Numéro
Rubrique
Conf. Issue: International Conf. on Recent Trends in Appl. and Comput. Math.
Licence
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
