Mostra el registre d'ítem simple
Neighbor-locating colorings in graphs
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.author | Alcón, Liliana |
dc.contributor.author | Gutierrez, Marisa |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2018-09-18T09:56:26Z |
dc.date.available | 2018-09-18T09:56:26Z |
dc.date.issued | 2018-06-29 |
dc.identifier.citation | Hernando, M., Mora, M., Pelayo, I. M., Alcón, L., Gutierrez, M. "Neighbor-locating colorings in graphs". 2018. |
dc.identifier.uri | http://hdl.handle.net/2117/121239 |
dc.description.abstract | A k -coloring of a graph G is a k -partition ¿ = { S 1 ,...,S k } 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 ¿ NL ( 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.format.extent | 20 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 | domination |
dc.subject.other | location |
dc.subject.other | vertex partition |
dc.subject.other | neighbor-locating coloring |
dc.title | Neighbor-locating colorings in graphs |
dc.type | External research report |
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.relation.publisherversion | https://arxiv.org/pdf/1806.11465.pdf |
dc.rights.access | Open Access |
local.identifier.drac | 23338210 |
dc.description.version | Preprint |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT |
local.citation.author | Hernando, M.; Mora, M.; Pelayo, I. M.; Alcón, L.; Gutierrez, M. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [403]
-
Reports de recerca [40]
-
Reports de recerca [5]