Alternative approaches to the description of classes of isomorphic graphs
Prikladnaâ diskretnaâ matematika, no. 3 (2014), pp. 86-97

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Mots-clés : graph isomorphism, graph invariants.
Keywords: automorphic equivalence classes of vertices, automorphic equivalence classes of edges
@article{PDM_2014_3_a7,
     author = {M. N. Nazarov},
     title = {Alternative approaches to the description of classes of isomorphic graphs},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {86--97},
     publisher = {mathdoc},
     number = {3},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2014_3_a7/}
}
TY  - JOUR
AU  - M. N. Nazarov
TI  - Alternative approaches to the description of classes of isomorphic graphs
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2014
SP  - 86
EP  - 97
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2014_3_a7/
LA  - ru
ID  - PDM_2014_3_a7
ER  - 
%0 Journal Article
%A M. N. Nazarov
%T Alternative approaches to the description of classes of isomorphic graphs
%J Prikladnaâ diskretnaâ matematika
%D 2014
%P 86-97
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2014_3_a7/
%G ru
%F PDM_2014_3_a7
M. N. Nazarov. Alternative approaches to the description of classes of isomorphic graphs. Prikladnaâ diskretnaâ matematika, no. 3 (2014), pp. 86-97. http://geodesic.mathdoc.fr/item/PDM_2014_3_a7/