UNI-LABELING OF GRAPHS OVER FINITE COMMUTATIVE RINGS

UNI-LABELING OF GRAPHS

Ré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

Les données sur le téléchargement ne sont pas encore disponible.
Publiée
2026-02-04
Rubrique
Special Issue: International Conf. on Recent Trends in Appl. and Comput. Math.