On 2-Domination in Hexagonal Networks

In a graph G=(V,E), a subset D of V(G) is called a 2-dominating set if every vertex of V(G)\D has two neighbours in D. The 2-domination number is the minimum order of such a set D and it is represented by γ
2
(G). In this paper, we obtained the bound (upper) for 2-domination number of Hexagonal networks.