Alternative approaches to the description of classes of isomorphic graphs

An algorithm for natural indexing of automorphic equivalence classes of vertices and edges in finite graphs is proposed. Using this indexing, the alternative description of graph isomorphism classes is constructed. It is also demonstrated that one can apply such classical concepts as colouring, operations on graphs and subgraphs to the graph isomorphism classes.