On Efficient Zero Ring Labeling and Restricted Zero Ring Graphs

Francis Joseph Hernandez Campena, Dhenmar Chua, Floresto Franco, Jr., Jon-jon Casica


In [3], Acharya et al. introduced the notion of a zero ring labeling of a connected
graph G, where vertices are labeled by the elements of a zero ring such that the sum of the labels of adjacent vertices is not the additive identity of the ring. Archarya and Pranjali [1] also constructed a graph based on a finite zero ring called the zero ring graph. In [5], Chua et al. defined a class of zero ring labeling called efficient zero ring labeling and it was shown that a labeling scheme exists for some families of trees. In this paper, we provide an efficient zero ring labeling for some classes of graphs. We also introduce the notion of the restricted zero ring graphs and use them to show that a zero ring labeling exists for some classes of cactus graphs.


efficient zero ring labeling; zero ring labeling; zero ring

Full Text: