Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: universal fixer

Sortuj według:

Ogranicz wyniki do:

Distance 2-Domination in Prisms of Graphs

100%

Hurtado F., Mora M., Rivera-Campo E., Zuazua R.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 2

383-397

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Hurtado F.

1 Mora M.

1 Rivera-Campo E.

1 Zuazua R.

1 2017

Wyniki wyszukiwania

Distance 2-Domination in Prisms of Graphs