Mostra el registre d'ítem simple
Neighbor-locating coloring: graph operations and extremal cardinalities
dc.contributor.author | Hernando Martín, María del Carmen |
dc.contributor.author | Mora Giné, Mercè |
dc.contributor.author | Pelayo Melero, Ignacio Manuel |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2018-10-10T12:21:16Z |
dc.date.available | 2020-07-01T00:26:26Z |
dc.date.issued | 2018-07-01 |
dc.identifier.citation | Hernando, M., Mora, M., Pelayo, I. M. Neighbor-locating coloring: graph operations and extremal cardinalities. "Electronic notes in discrete mathematics", 1 Juliol 2018, vol. 68, núm. July 2018, p. 131-136. |
dc.identifier.issn | 1571-0653 |
dc.identifier.uri | http://hdl.handle.net/2117/122161 |
dc.description | © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ |
dc.description.abstract | A k–coloring of a graph is a k-partition 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 , 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. 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 with neighbor-locating chromatic number equal either to n or to and determine the neighbor-locating chromatic number of split graphs. |
dc.format.extent | 6 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Graph theory |
dc.subject.other | Coloring |
dc.subject.other | location |
dc.subject.other | neighbor-location |
dc.subject.other | complete multipartite |
dc.subject.other | graph join |
dc.subject.other | graph |
dc.subject.other | split graph |
dc.subject.other | disjoint union |
dc.subject.other | Cartesian product |
dc.title | Neighbor-locating coloring: graph operations and extremal cardinalities |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. DCG - Discrete and Combinatorial Geometry |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1016/j.endm.2018.06.023 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S1571065318301148 |
dc.rights.access | Open Access |
local.identifier.drac | 23309974 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Hernando, M.; Mora, M.; Pelayo, I. M. |
local.citation.publicationName | Electronic notes in discrete mathematics |
local.citation.volume | 68 |
local.citation.number | July 2018 |
local.citation.startingPage | 131 |
local.citation.endingPage | 136 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [29]
-
Articles de revista [3.269]
-
Articles de revista [290]