Abstract
We investigate dependence of recursively enumerable graphs on the equality relation given by a specific r.e. equivalence relation on omega. In particular we compare r.e, equivalence relations in terms of graphs they permit to represent. This defines partially ordered sets that depend on classes of graphs under consideration. We investigate some algebraic properties of these partially ordered sets. For instance, we show that some of these partial ordered sets possess atoms, minimal and maximal elements. We also fully describe the isomorphism types of some of these partial orders. (c) 2014 Elsevier B.V. All rights reserved.