We present in this paper a code for the class of unlabeled split–indifference graphs. This codification allows us to establish the exact number of elements of the class up to isomorphism. In order to obtain this result, structural properties of the class are explored, including a new approach for the characterization theorem.