On the Decision Number of Graphs

S. Akbari, M. Dalirrooyfard, S. Davodpoor +2

Let $G$ be a graph. A good function is a function $f:V(G)\to \{-1,1\}$, satisfying $f(N(v))\ge 1$, for each $v\in V(G)$, where $N(v)=\{u\in V(G)|uv\in E(G)\}$ and…