Restrained 2-Domination Number of Complete Grid Graphs
Jagan Mohan Jonnalagadda, Indrani Pramod Kelkar · International journal of applied mathematics and computation · 2012
In this paper we present 2-dominating sets for complete grid graphs $G_{k,n}$ by using V-merge and H-merge techniques recursively and then find 2-domination and restrined 2-domination numbers of complete grid graphs. We also verify the Vizing’s conjecture for both domination parameters.