Secure domination of honeycomb networks (Q2185819)

Let \(G=(V,E)\) be a graph. A set \(S \subseteq V(G)\) is said to be secure if the security condition, for every \(X \subseteq S\), \(|N[X] \cap S| \ge |N[X]- S|\) holds. Now, a set \(S \subseteq V(G)\) is secure dominating, if it is both secure and dominating. The secure (resp. secure domination) number of \(G\), \(s(G)\) (resp. \(\gamma_s(G)\)) is the minimum cardinality of a secure (resp. secure dominating) set in \(G\). A high level honeycomb network can be constructed from a lowest one. A unit honeycomb network is a hexagon, denoted by \(HC(1)\). A honeycomb network of size two is denoted as \(HC(2)\) and can be obtained by adding six hexagons around the boundary of \(HC(1)\). Inductively, honeycomb network \(HC(n)\) can be obtained from \(HC(n-1)\) by adding a layer of hexagons around the boundary edges of \(HC(n-1)\). In this paper, the authors have studied the security number and secure domination number of honeycomb networks. The main results of this paper are as follows: \begin{enumerate} \item \(s(HC(n)) = 2\). \item \(\gamma_s(HC(1)) = 4\) and \(\gamma_s(HC(2)) =12\). \item For \(n\ge 3\), \(3n^2 \le \gamma_s(HC(n)) \le 3n^2 + 1\). \end{enumerate}