|
This article is cited in 3 scientific papers (total in 3 papers)
Graph Isomorphism and Equality of Simplices
V. Yu. Protasov M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
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.
Keywords:
graph isomorphism, graph recognition, graph invariants, simplex invariants.
Received: 03.04.2008 Revised: 12.10.2008
Citation:
V. Yu. Protasov, “Graph Isomorphism and Equality of Simplices”, Mat. Zametki, 85:5 (2009), 758–767; Math. Notes, 85:5 (2009), 724–732
Linking options:
https://www.mathnet.ru/eng/mzm4743https://doi.org/10.4213/mzm4743 https://www.mathnet.ru/eng/mzm/v85/i5/p758
|
Statistics & downloads: |
Abstract page: | 908 | Full-text PDF : | 280 | References: | 56 | First page: | 50 |
|