Mostra el registre d'ítem simple
Nordhaus-Gaddum bounds for locating domination
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àtica Aplicada I |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III |
dc.date.accessioned | 2013-12-17T11:50:01Z |
dc.date.created | 2014-02-01 |
dc.date.issued | 2014-02-01 |
dc.identifier.citation | Hernando, M.; Mora, M.; Pelayo, I. Nordhaus-Gaddum bounds for locating domination. "European journal of combinatorics", 01 Febrer 2014, vol. 36, p. 1-6. |
dc.identifier.issn | 0195-6698 |
dc.identifier.uri | http://hdl.handle.net/2117/21023 |
dc.description.abstract | A dominating set S of graph G is called metric-locating–dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S, then it is said to be locating–dominating. Locating, metric-locating–dominating and locating–dominating sets of minimum cardinality are called β-codes, η-codes and λ-codes, respectively. A Nordhaus–Gaddum bound is a tight lower or upper bound on the sum or product of a parameter of a graph G and its complement View the MathML source. In this paper, we present some Nordhaus–Gaddum bounds for the location number β, the metric-location–domination number η and the location–domination number λ. Moreover, in each case, the graph family attaining the corresponding bound is fully characterized. |
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 | Statistics |
dc.title | Nordhaus-Gaddum bounds for locating domination |
dc.type | Article |
dc.subject.lemac | Estadística |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1016/j.ejc.2013.04.009 |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 12916344 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Hernando, M.; Mora, M.; Pelayo, I. |
local.citation.publicationName | European journal of combinatorics |
local.citation.volume | 36 |
local.citation.startingPage | 1 |
local.citation.endingPage | 6 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.268]
-
Articles de revista [290]