Abstract:
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.
Fulltext:
PDF file (473 kB)
