ON THE 2-DOMINATION NUMBER OF CARTESIAN PRODUCT OF TWO CYCLES
A set D of vertices of a graph is called 2-dominatingif every vertex has at least two neighbors in D. The2-domination number of a graph G, is the order of a smallest 2-dominating set of G. In this paper, we calculate the 2-domination number of the product of two cycles for and arbitrary n.
k-dominating set, k-domination number, 2-dominating set, 2-domination number, Cartesian product graphs, cycles.