Abstract
A-distance coloringof is said to be adjacent vertex distinguishing if this coloring satisfy for any pair of adjacent vertices and in, wheredenotes the set of colors that are received by the vertex and all neighbors of with respect to. The minimum number of colors necessary to adjacent vertex distinguishing-distance color, is denoted by. In this paper, we give the exact values of forand, where denotes the-dimensional grid.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
