Distance 2-Domination in Prisms of Graphs

• Autorzy: Ferran Hurtado , Mercè Mora , Eduardo Rivera-Campo , Rita Zuazua
• Języki publikacji: EN

Abstrakty

EN

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 π of the vertex set of G, the prism of G with respect to π is the graph πG obtained from G and a copy G′ of G by joining u ∊ V(G) with v′ ∊ V(G′) if and only if v′ = π(u). If γ2(πG) = γ2(G) for any permutation π 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.

Słowa kluczowe

EN

distance 2 dominating set; prisms of graphs; universal fixer

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 2
• Strony: 383-397

Daty

wydano

2017-05-01

otrzymano

2015-11-27

poprawiono

2016-06-02

zaakceptowano

2016-06-02

online

2017-04-01

Twórcy

autor

Ferran Hurtado

• Universitat Politècnica de Catalunya Barcelona,

autor

Mercè Mora

• Universitat Politècnica de Catalunya Barcelona,

autor

Eduardo Rivera-Campo

• Universidad Autónoma Metropolitana-Iztapalapa,

autor

Rita Zuazua

• Universidad Nacional Autónoma de México,

Identyfikatory

DOI

10.7151/dmgt.1946