Distance 2-domination in prisms of graphs

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...

Full description

Bibliographic Details
Authors: Hurtado Díaz, Fernando Alfredo|||0000-0002-0108-9671, Mora Giné, Mercè|||0000-0001-6923-0320, Rivera Campo, Eduardo, Zuazua Vega, Rita Esther
Format: article
Publication Date:2017
Country:España
Institution:Universitat Politècnica de Catalunya (UPC)
Repository:UPCommons. Portal del coneixement obert de la UPC
Language:English
OAI Identifier:oai:upcommons.upc.edu:2117/112675
Online Access:https://hdl.handle.net/2117/112675
https://dx.doi.org/10.7151/dmgt.1946
Access Level:Open access
Keyword:Graph theory
distance 2-dominating set
prisms of graphs
universal fixer
Grafs, Teoria de
Classificació AMS::05 Combinatorics::05C Graph theory
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
id ES_b1d142f2ebed736ab116d19554d7abca
oai_identifier_str oai:upcommons.upc.edu:2117/112675
network_acronym_str ES
network_name_str España
repository_id_str
spelling Distance 2-domination in prisms of graphsHurtado Díaz, Fernando Alfredo|||0000-0002-0108-9671Mora Giné, Mercè|||0000-0001-6923-0320Rivera Campo, EduardoZuazua Vega, Rita EstherGraph theorydistance 2-dominating setprisms of graphsuniversal fixerGrafs, Teoria deClassificació AMS::05 Combinatorics::05C Graph theoryÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafsA 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.Peer Reviewed20172017-01-0120182018-01-11journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/112675https://dx.doi.org/10.7151/dmgt.1946reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1126752026-05-27T15:37:01Z
dc.title.none.fl_str_mv Distance 2-domination in prisms of graphs
title Distance 2-domination in prisms of graphs
spellingShingle Distance 2-domination in prisms of graphs
Hurtado Díaz, Fernando Alfredo|||0000-0002-0108-9671
Graph theory
distance 2-dominating set
prisms of graphs
universal fixer
Grafs, Teoria de
Classificació AMS::05 Combinatorics::05C Graph theory
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
title_short Distance 2-domination in prisms of graphs
title_full Distance 2-domination in prisms of graphs
title_fullStr Distance 2-domination in prisms of graphs
title_full_unstemmed Distance 2-domination in prisms of graphs
title_sort Distance 2-domination in prisms of graphs
dc.creator.none.fl_str_mv Hurtado Díaz, Fernando Alfredo|||0000-0002-0108-9671
Mora Giné, Mercè|||0000-0001-6923-0320
Rivera Campo, Eduardo
Zuazua Vega, Rita Esther
author Hurtado Díaz, Fernando Alfredo|||0000-0002-0108-9671
author_facet Hurtado Díaz, Fernando Alfredo|||0000-0002-0108-9671
Mora Giné, Mercè|||0000-0001-6923-0320
Rivera Campo, Eduardo
Zuazua Vega, Rita Esther
author_role author
author2 Mora Giné, Mercè|||0000-0001-6923-0320
Rivera Campo, Eduardo
Zuazua Vega, Rita Esther
author2_role author
author
author
dc.subject.none.fl_str_mv Graph theory
distance 2-dominating set
prisms of graphs
universal fixer
Grafs, Teoria de
Classificació AMS::05 Combinatorics::05C Graph theory
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
topic Graph theory
distance 2-dominating set
prisms of graphs
universal fixer
Grafs, Teoria de
Classificació AMS::05 Combinatorics::05C Graph theory
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
description 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.
publishDate 2017
dc.date.none.fl_str_mv 2017
2017-01-01
2018
2018-01-11
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/112675
https://dx.doi.org/10.7151/dmgt.1946
url https://hdl.handle.net/2117/112675
https://dx.doi.org/10.7151/dmgt.1946
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869416982417244160
score 15.301603

Similar Items