Learn More
A graph G is a difference graph iff there exists S ⊂ IN such that G is isomorphic to the graph DG(S) = (V,E), where V = S and E = {{i, j} : i, j ∈ V ∧ |i− j| ∈ V }. It is known that trees, cycles,(More)
A digraph G is a difference digraph iff there exists an S ⊂ IN such that G is isomorphic to the digraph DD(S) = (V,A), where V = S and A = {(i, j) : i, j ∈ V ∧ i− j ∈ V }. For some classes of(More)