SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
2009 ◽
Vol 20
(03)
◽
pp. 479-499
Keyword(s):
The graph isomorphism problem is to check if two given graphs are isomorphic. Graph isomorphism is a well studied problem and numerous algorithms are available for its solution. In this paper we present algorithms for graph isomorphism that employ the spectra of graphs. An open problem that has fascinated many a scientist is if there exists a polynomial time algorithm for graph isomorphism. Though we do not solve this problem in this paper, the algorithms we present take polynomial time. These algorithms have been tested on a good collection of instances. However, we have not been able to prove that our algorithms will work on all possible instances. In this paper, we also give a new construction for cospectral graphs.
2014 ◽
Vol Vol. 16 no. 2
(PRIMA 2013)
◽
2001 ◽
Vol 262
(1-2)
◽
pp. 161-189
◽
Keyword(s):
1995 ◽
pp. 409-417
◽
Keyword(s):