Hence if π = 1, then πG = K₂×G, the prism of G. Clearly, γ(G) ≤ γ(πG) ≤ 2 γ(G). We study graphs for which γ(K₂×G) = 2γ(G), those for which γ(πG) = 2γ(G) for at ...

A dominating set D is a minimal dominating set if no proper subset of D is a dominating set. The number of elements in such set is called as domination number ...

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

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

TL;DR: In this article, the domination number of a permutation permutation graph is studied in the sense of Chartrand and Harary's domination in functigraphs, ...

The forcing domination numbers of several classes of graphs are determined, including complete multipartite graphs, paths, cycles, ladders, and prisms. The ...

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

Azarija et al. [1] asked what the smallest the total domination number of the prism could be as a function of the domination number of the original graph.

The number of elements in such set is called as domination number of graph and is denoted by γ(G). In this work the domination numbers are obtained for family ...

Feb 3, 2017 · Using hypergraph transversals it is proved that γt(Qn+1)=2γ(Qn) γ t ( Q n + 1 ) = 2 γ ( Q n ) , where γt(G) γ t ( G ) and γ(G) γ ( G ) denote ...