Mostra el registre d'ítem simple
Distance 2-domination in prisms of graphs
dc.contributor.author | Hurtado Díaz, Fernando Alfredo |
dc.contributor.author | Mora Giné, Mercè |
dc.contributor.author | Rivera Campo, Eduardo |
dc.contributor.author | Zuazua Vega, Rita Esther |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2018-01-11T13:45:30Z |
dc.date.available | 2018-06-01T00:30:21Z |
dc.date.issued | 2017-01-01 |
dc.identifier.citation | Hurtado, F., Mora, M., Rivera-Campo, Eduardo, Zuazua, R. Distance 2-domination in prisms of graphs. "Discussiones mathematicae. Graph theory", 1 Gener 2017, vol. 37, núm. 2, p. 383-397. |
dc.identifier.issn | 1234-3099 |
dc.identifier.uri | http://hdl.handle.net/2117/112675 |
dc.description.abstract | A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ¿ ( V ( G ) - D ) and D is at most two. Let ¿ 2 ( G ) denote the size of a smallest distance 2 -dominating set of G . For any permutation p of the vertex set of G , the prism of G with respect to p is the graph pG obtained from G and a copy G ' of G by joining u ¿ V ( G ) with v ' ¿ V ( G ' ) if and only if v ' = p ( u ) . If ¿ 2 ( pG ) = ¿ 2 ( G ) for any permutation p of V ( G ) , then G is called a universal ¿ 2 - fixer. In this work we characterize the cycles and paths that are universal ¿ 2 -fixers. |
dc.format.extent | 15 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::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Graph theory |
dc.subject.other | distance 2-dominating set |
dc.subject.other | prisms of graphs |
dc.subject.other | universal fixer |
dc.title | Distance 2-domination in prisms of graphs |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.7151/dmgt.1946 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.relation.publisherversion | http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1946 |
dc.rights.access | Open Access |
local.identifier.drac | 19857099 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Hurtado, F.; Mora, M.; Rivera-Campo, Eduardo; Zuazua, Rita |
local.citation.publicationName | Discussiones mathematicae. Graph theory |
local.citation.volume | 37 |
local.citation.number | 2 |
local.citation.startingPage | 383 |
local.citation.endingPage | 397 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.267]