Graph isomorphism and equality of simplices

We show that the graph isomorphism problem is equivalent to the problem of recognizing equal simplices in ? ⁿ . 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.