Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
69.161 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Distance 2-domination in prisms of graphs

Thumbnail
View/Open
Versió prèvia a l'edició final de l'article en revista. (332,7Kb)
 
10.7151/dmgt.1946
 
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/112675

Show full item record
Hurtado Díaz, Fernando AlfredoMés informacióMés informació
Mora Giné, MercèMés informacióMés informacióMés informació
Rivera Campo, Eduardo
Zuazua Vega, Rita Esther
Document typeArticle
Defense date2017-01-01
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
This work is protected by the corresponding intellectual and industrial property rights. Except where otherwise noted, its contents are licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
CitationHurtado, 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. 
URIhttp://hdl.handle.net/2117/112675
DOI10.7151/dmgt.1946
ISSN1234-3099
Publisher versionhttp://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1946
Collections
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta - Articles de revista [85]
  • Departament de Matemàtiques - Articles de revista [3.475]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
HMRZ15.pdfVersió prèvia a l'edició final de l'article en revista.332,7KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina