Neighbor-locating colorings in graphs
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...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Articulo Preprint |
| Lenguaje: | Inglés |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/124999 |
| Aporte de: |
| id |
I19-R120-10915-124999 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Matemática Coloring Domination Location Vertex partition Neighbor-locating coloring |
| spellingShingle |
Matemática Coloring Domination Location Vertex partition Neighbor-locating coloring Alcón, Liliana Graciela Gutiérrez, Marisa Hernando, Carmen Mora, Mercè Pelayo, Ignacio M. Neighbor-locating colorings in graphs |
| topic_facet |
Matemática Coloring Domination Location Vertex partition Neighbor-locating coloring |
| 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. |
| format |
Articulo Preprint |
| author |
Alcón, Liliana Graciela Gutiérrez, Marisa Hernando, Carmen Mora, Mercè Pelayo, Ignacio M. |
| author_facet |
Alcón, Liliana Graciela Gutiérrez, Marisa Hernando, Carmen Mora, Mercè Pelayo, Ignacio M. |
| author_sort |
Alcón, Liliana Graciela |
| title |
Neighbor-locating colorings in graphs |
| title_short |
Neighbor-locating colorings in graphs |
| title_full |
Neighbor-locating colorings in graphs |
| title_fullStr |
Neighbor-locating colorings in graphs |
| title_full_unstemmed |
Neighbor-locating colorings in graphs |
| title_sort |
neighbor-locating colorings in graphs |
| publishDate |
2020 |
| url |
http://sedici.unlp.edu.ar/handle/10915/124999 |
| work_keys_str_mv |
AT alconlilianagraciela neighborlocatingcoloringsingraphs AT gutierrezmarisa neighborlocatingcoloringsingraphs AT hernandocarmen neighborlocatingcoloringsingraphs AT moramerce neighborlocatingcoloringsingraphs AT pelayoignaciom neighborlocatingcoloringsingraphs |
| bdutipo_str |
Repositorios |
| _version_ |
1764820451399303168 |