In the case of a finite dimensional vector space
,
any ordered basis can be used to give distinct codes for elements of
.
Chartrand et al introduced coding for vertices of a finite connected graph using
distance. A binary coding of vertices of a graph (connected or disconnected) was
suggested by Suganthi. Motivated by these results, a new type of coding, called
neighborhood distinguishing coloring code, is introduced in this paper. A study of
this code is initiated.
Keywords
Neighborhood distinguishing coloring code, neighborhood
distinguishing coloring number of a graph