Vol. 13, No. 1, 2013

Download this article
Download this article For screen
For printing
Recent Issues
Volume 17, Issue 3 (189-249)
Volume 17, Issue 2 (77-188)
Volume 17, Issue 1 (1-75)
Volume 16, Issue 1
Volume 15, Issue 1
Volume 14, Issue 1
Volume 13, Issue 1
Volume 12, Issue 1
Volume 11, Issue 1
Volume 10, Issue 1
Volume 9, Issue 1
Volume 8, Issue 1
Volume 6+7, Issue 1
Volume 5, Issue 1
Volume 4, Issue 1
Volume 3, Issue 1
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
About the Journal
Editorial Board
Subscriptions
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
ISSN (electronic): 2640-7345
ISSN (print): 2640-7337
Author Index
To Appear
 
Other MSP Journals
Neighbourhood distinguishing coloring in graphs

R. Ramar and V. Swaminathan

Vol. 13 (2013), No. 1, 135–140
Abstract

In the case of a finite dimensional vector space V , any ordered basis can be used to give distinct codes for elements of V . 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
Mathematical Subject Classification 2010
Primary: 05C15
Milestones
Received: 5 February 2012
Accepted: 8 July 2012
Authors
R. Ramar
Research Scholar, Research and Development Centre
Bharathiar University
Coimbatore 641 046
India
V. Swaminathan
Ramanujan Research Center in Mathematics
Saraswathy Narayanan College
Madurai 625018
India