Neighbor-locating coloring: graph operations and extremal cardinalities
A k–coloring of a graph G = ( V , E ) is a k-partition II = { S 1 , … , S k } of V 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...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Articulo Preprint |
| Lenguaje: | Inglés |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/125581 |
| Aporte de: |
| id |
I19-R120-10915-125581 |
|---|---|
| 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 Location Neighbor-location Complete multipartite graph Join graph Split graph Disjoint union Cartesian product |
| spellingShingle |
Matemática Coloring Location Neighbor-location Complete multipartite graph Join graph Split graph Disjoint union Cartesian product Hernando, Carmen Mora, Mercè Pelayo, Ignacio M. Alcón, Liliana Graciela Gutiérrez, Marisa Neighbor-locating coloring: graph operations and extremal cardinalities |
| topic_facet |
Matemática Coloring Location Neighbor-location Complete multipartite graph Join graph Split graph Disjoint union Cartesian product |
| description |
A k–coloring of a graph G = ( V , E ) is a k-partition II = { S 1 , … , S k } of V 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, χ NL (G) , is the minimum cardinality of a neighbor-locating coloring of G. In this paper, we examine the neighbor-locating chromatic number for various graph operations: the join, the disjoint union and Cartesian product. We also characterize all connected graphs of order n ≥ 3 with neighbor-locating chromatic number equal either to n or to n − 1 and determine the neighbor-locating chromatic number of split graphs. |
| format |
Articulo Preprint |
| author |
Hernando, Carmen Mora, Mercè Pelayo, Ignacio M. Alcón, Liliana Graciela Gutiérrez, Marisa |
| author_facet |
Hernando, Carmen Mora, Mercè Pelayo, Ignacio M. Alcón, Liliana Graciela Gutiérrez, Marisa |
| author_sort |
Hernando, Carmen |
| title |
Neighbor-locating coloring: graph operations and extremal cardinalities |
| title_short |
Neighbor-locating coloring: graph operations and extremal cardinalities |
| title_full |
Neighbor-locating coloring: graph operations and extremal cardinalities |
| title_fullStr |
Neighbor-locating coloring: graph operations and extremal cardinalities |
| title_full_unstemmed |
Neighbor-locating coloring: graph operations and extremal cardinalities |
| title_sort |
neighbor-locating coloring: graph operations and extremal cardinalities |
| publishDate |
2018 |
| url |
http://sedici.unlp.edu.ar/handle/10915/125581 |
| work_keys_str_mv |
AT hernandocarmen neighborlocatingcoloringgraphoperationsandextremalcardinalities AT moramerce neighborlocatingcoloringgraphoperationsandextremalcardinalities AT pelayoignaciom neighborlocatingcoloringgraphoperationsandextremalcardinalities AT alconlilianagraciela neighborlocatingcoloringgraphoperationsandextremalcardinalities AT gutierrezmarisa neighborlocatingcoloringgraphoperationsandextremalcardinalities |
| bdutipo_str |
Repositorios |
| _version_ |
1764820451909959680 |