Graph isomorphism and equality of simplices

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

Full description

Saved in:
Bibliographic Details
Published inMathematical Notes Vol. 85; no. 5-6; pp. 724 - 732
Main Author Protasov, V. Yu
Format Journal Article
LanguageEnglish
Published Dordrecht SP MAIK Nauka/Interperiodica 01.06.2009
Subjects
Mathematics
Mathematics and Statistics
graph isomorphism
graph recognition
graph invariants
simplex invariants
Online AccessGet full text

Cover

More Information
Summary:We show that the graph isomorphism problem is equivalent to the problem of recognizing equal simplices in ℝ 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.
ISSN:0001-4346
1573-8876
DOI:10.1134/S0001434609050137