Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Mathematics and Computation
Paper Title
Journal
Date
