I don&#x27;t mean directed graphs, only vertices and edges.<p>I don&#x27;t think you would need to deal with infinite graphs, as &quot;arbitrarily large&quot; should be able to cover all (finite) possible computations and&#x2F;or representations.<p>My guess is that every graph may correspond to an infinite number (though, not necessarily every) of possible computations and&#x2F;or representations, depending on which &quot;correspondence function&quot; is being used to analyze the graph (though there may be additional &quot;correspondences&quot; between those functions and&#x2F;or their results).