The inapproximability for the (0,1)-additive number

Arash Ahadi, Ali Dehghan

An {\it additive labeling} of a graph $G$ is a function $\ell :V(G)\to \mathbb{N}$, such that for every two adjacent vertices $v$ and $u$ of $G$, $ \sum_{w \sim v}\el…