Graph isomorphism and equality of simplices

被引：0

作者：

V. Yu. Protasov

机构：

[1] Moscow State University,

来源：

Mathematical Notes | 2009年 / 85卷

关键词：

graph isomorphism; graph recognition; graph invariants; simplex invariants;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：724 / 732

页数：8

共 50 条

[1] Graph isomorphism and equality of simplices
Protasov, V. Yu.
[J]. MATHEMATICAL NOTES, 2009, 85 (5-6) : 724 - 732
[2] A TERM EQUALITY PROBLEM EQUIVALENT TO GRAPH ISOMORPHISM
BASIN, DA
[J]. INFORMATION PROCESSING LETTERS, 1994, 51 (02) : 61 - 66
[3] Isomorphism is equality
Coquand, Thierry
Danielsson, Nils Anders
[J]. INDAGATIONES MATHEMATICAE-NEW SERIES, 2013, 24 (04): : 1105 - 1120
[4] Reduction of the graph isomorphism problem to checking the equality of polynomials of n variables
Prolubnikov, A., V
[J]. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2016, 22 (01): : 235 - 240
[5] Isomorphism of the graph
Wu, Huaan
[J]. DCABES 2007 Proceedings, Vols I and II, 2007, : 1104 - 1106
[6] ON GRAPH ISOMORPHISM AND GRAPH AUTOMORPHISM
ZIVKOVIC, TP
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1991, 8 (1-3) : 19 - 37
[7] Reductions to graph isomorphism
Toran, Jacobo
[J]. FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 158 - 167
[8] RANDOM GRAPH ISOMORPHISM
BABAI, L
ERDOS, P
SELKOW, SM
[J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 628 - 635
[9] Reductions to Graph Isomorphism
Jacobo Torán
[J]. Theory of Computing Systems, 2010, 47 : 288 - 299
[10] On graph isomorphism for restricted graph classes
Koebler, Johannes
[J]. LOGICAL APPROACHES TO COMPUTATIONAL BARRIERS, PROCEEDINGS, 2006, 3988 : 241 - 256

← 1 2 3 4 5 →