Loading...
Loading...

Go to the content (press return)

Neighbor-locating colorings in graphs

Author
Alcón, L.; Gutierrez, M.; Hernando, M.; Mora, M.; Pelayo, I. M.
Type of activity
Journal article
Journal
Theoretical computer science
Date of publication
2020-02-02
Volume
806
First page
144
Last page
155
DOI
10.1016/j.tcs.2019.01.039
Project funding
Combinatorics of networks and computation
URL
https://www.sciencedirect.com/science/article/pii/S0304397519300805?via%3 Open in new window
Abstract
A k-coloring of a graph G is a k-partition of into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices belonging to the same color , the set of colors of the neighborhood of u is different from the set of colors of the neighborhood of v. The neighbor-locating chromatic number is the minimum cardinality of a neighbor-locating coloring of G. We establish some tight bounds for the neighbor-locating chromatic number of a graph, in terms of its...
Keywords
Coloring, Domination, Location, Neighbor-locating coloring, Vertex partition
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants