Nagamochi, H.; Miller, M.; Slamin (Discrete Mathematics, 2001)
A simple undirected graph H is called a sum graph if there is a labeling L of the vertices
of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with ...