The Neighbour Sum Problem on Trees

Sayan Dutta, Sohom Gupta

A graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$ is said to satisfy the Neighbour Sum Property if there exists some $f:\mathcal{V}\to \mathbb{R}$ such that $f\not\equiv 0$ and it maps…