Exact graphs (Q1341242)

The authors call a graph \(G\) exactly numerable if and only if there exists a bijection \(\phi\) from \(V(G)\cup E(G)\) to the set of the first \(m\) positive integers, such that, for all \(v\in V\), \(\phi(v)\) is the sum of all \(\phi(e)\), where \(e\) is incident with \(v\). They show that there exists an exact graph with cardinality \(m\) iff \(m\geq 6\), \(m\neq 9\), and \(m\not\equiv 1\pmod 3\).