Efficient Domination in Lattice graphs

A. Senthil Thilak, Bharadwaj

Given a graph $G$, a subset $S$ of vertices of $G$ is an efficient dominating set ($EDS$) if $|N[v]\cap S|=1,$ for all $v\in V(G)$. A graph $G$ is efficiently dominatable if it po…