Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 18 июля 2013 г.
Аннотация:We show that the graph isomorphism problem is equivalent to the problem of recognizing
equal simplices in Rn. 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.