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

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

This work characterize the cycles and paths that are universal γ2-fixers, which are described as graphs that have at most two vertices and a minimum ...

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.

May 1, 2017 · 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 ...

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

Jan 1, 2017 · 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 ...

For a permutation π of the vertex set of a graph G, the graph πG is obtained from two disjoint copies G 1 and G 2 of G by joining each v in G 1 to π(v) in G ...

Jan 10, 2022 · In this paper, we find some relations between the domination and the p-domination numbers in the context of graph and its prism graph for particular values of ...

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.