Innovations in Incidence Geometry
- Innov. Incidence Geom.
- Volume 13, Number 1 (2013), 135-140.
Neighbourhood distinguishing coloring in graphs
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.
Innov. Incidence Geom., Volume 13, Number 1 (2013), 135-140.
Received: 5 February 2012
Accepted: 8 July 2012
First available in Project Euclid: 28 February 2019
Permanent link to this document
Digital Object Identifier
Zentralblatt MATH identifier
Primary: 05C15: Coloring of graphs and hypergraphs
Ramar, Rajasekaran; Venkatasubramanian, Swaminathan. Neighbourhood distinguishing coloring in graphs. Innov. Incidence Geom. 13 (2013), no. 1, 135--140. doi:10.2140/iig.2013.13.135. https://projecteuclid.org/euclid.iig/1551323046