Geodesic
Graph Isomorphism and Equality of Simplices
Matematičeskie zametki, Tome 85 (2009) no. 5, pp. 758-767

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

We show that the graph isomorphism problem is equivalent to the problem of recognizing equal simplices in $\mathbb R^n$. This result can lead to new methods in the graph isomorphism problem based on geometrical properties of simplices. In particular, relations between several well-known classes of invariants of graphs and geometrical invariants of simplices are established.
Mots-clés : graph isomorphism, graph invariants, simplex invariants.
Keywords: graph recognition 
@article{MZM_2009_85_5_a11,
     author = {V. Yu. Protasov},
     title = {Graph {Isomorphism} and {Equality} of {Simplices}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {758--767},
     publisher = {mathdoc},
     volume = {85},
     number = {5},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2009_85_5_a11/}
}
TY  - JOUR
AU  - V. Yu. Protasov
TI  - Graph Isomorphism and Equality of Simplices
JO  - Matematičeskie zametki
PY  - 2009
SP  - 758
EP  - 767
VL  - 85
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2009_85_5_a11/
LA  - ru
ID  - MZM_2009_85_5_a11
ER  - 
%0 Journal Article
%A V. Yu. Protasov
%T Graph Isomorphism and Equality of Simplices
%J Matematičeskie zametki
%D 2009
%P 758-767
%V 85
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2009_85_5_a11/
%G ru
%F MZM_2009_85_5_a11
V. Yu. Protasov. Graph Isomorphism and Equality of Simplices. Matematičeskie zametki, Tome 85 (2009) no. 5, pp. 758-767. http://geodesic.mathdoc.fr/item/MZM_2009_85_5_a11/