Pair Sum Modulo Labelling of Spider Graph

Abstract

Agraphlabeling  is a task of numbering for the vertices, edges, or both subject to specific conditions. Graph labeling have been used in many applications.  For a simple graph Ɠ(Ṽ,Ẽ), a mapping Ψ : Ṽ |Ṽ|}is said to be a pair sum modulo labeling if the values for every edge uv,are distinct. A graph which admits pair sum modulo labeling is called a pair sum modulo graph. In this article, we have proven the existence of pair sum modulo labeling of spider graph of k legs, each of lengths 1or 2 or …or 5.