- Tytuł:
- Distance 2-Domination in Prisms of Graphs
- Autorzy:
-
Hurtado, Ferran
Mora, Mercè
Rivera-Campo, Eduardo
Zuazua, Rita - Powiązania:
- https://bibliotekanauki.pl/articles/31341963.pdf
- Data publikacji:
- 2017-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
distance 2 dominating set
prisms of graphs
universal fixer - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 2; 383-397
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł