Neighbor-locating coloring: graph operations and extremal cardinalities

dc.creatorHernando, Carmen
dc.creatorMora, Mercè
dc.creatorPelayo, Ignacio M.
dc.creatorAlcón, Liliana Graciela
dc.creatorGutiérrez, Marisa
dc.date2018
dc.date2021-09-24T16:26:43Z
dc.date.accessioned2023-07-15T03:11:27Z
dc.date.available2023-07-15T03:11:27Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/125581
dc.identifierissn:1571-0653
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7464780
dc.descriptionA 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.
dc.descriptionFacultad de Ciencias Exactas
dc.formatapplication/pdf
dc.format131-136
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectMatemática
dc.subjectColoring
dc.subjectLocation
dc.subjectNeighbor-location
dc.subjectComplete multipartite graph
dc.subjectJoin graph
dc.subjectSplit graph
dc.subjectDisjoint union
dc.subjectCartesian product
dc.titleNeighbor-locating coloring: graph operations and extremal cardinalities
dc.typeArticulo
dc.typePreprint


Este ítem pertenece a la siguiente institución