| dc.creator | Alcón, Liliana Graciela | |
| dc.creator | Gutiérrez, Marisa | |
| dc.creator | Hernando, Carmen | |
| dc.creator | Mora, Mercè | |
| dc.creator | Pelayo, Ignacio M. | |
| dc.date | 2020 | |
| dc.date | 2021-09-16T17:02:15Z | |
| dc.date.accessioned | 2023-07-15T03:09:37Z | |
| dc.date.available | 2023-07-15T03:09:37Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/124999 | |
| dc.identifier | issn:0304-3975 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7464665 | |
| dc.description | A k-coloring of a graph G is a k-partition II = { S1 , … , Sk } of V (G) into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices u , v belonging to the same color S i , 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 X N L (G) 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 order, maximum degree and independence number. We determine all connected graphs of order n ≥ 5 with neighbor-locating chromatic number n or n − 1 . We examine the neighbor-locating chromatic number for two graph operations: join and disjoint union, and also for two graph families: split graphs and Mycielski graphs. | |
| dc.description | Facultad de Ciencias Exactas | |
| dc.format | application/pdf | |
| dc.format | 144-155 | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by-nc-sa/4.0/ | |
| dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) | |
| dc.subject | Matemática | |
| dc.subject | Coloring | |
| dc.subject | Domination | |
| dc.subject | Location | |
| dc.subject | Vertex partition | |
| dc.subject | Neighbor-locating coloring | |
| dc.title | Neighbor-locating colorings in graphs | |
| dc.type | Articulo | |
| dc.type | Preprint | |
