Star partitions and the graph isomorphism problem

A canonical basis of R n associated with a graph G on n vertices has been defined in [15] in connection with eigenspaces and star partitions of G. The canonical star basis together with eigenvalues of G determines G to an isomorphism. We study algorithms for finding the canonical basis and some of its variations. The emphasis is on the following three special cases; graphs with distinct eigenvalues, graphs with bounded eigenvalue multiplicities and strongly regular graphs. We show that the procedure is reduced in some parts to special cases of some well known combinatorial optimization problems, such as the maximal matching problem. the minimal cut problem, the maximal clique problem etc. This technique provides another proof of a result of L. Babai et al. [2] that isomorphism testing for graphs with bounded eigenvalue multiplicities can be performend in a polynomial time. We show that the canonical basis in strongly regular graphs is related to the graph decomposition into two strongly regular induced su...

[1]  Egon Balas,et al.  On the Maximum Weight Clique Problem , 1987, Math. Oper. Res..

[2]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[3]  Y. D. Verdière.  On a novel graph invariant and a planarity criterion , 1990 .

[4]  V. G. Timkovskii.  Some recognition problems related to graph isomorphism , 1988 .

[5]  Pierre Hansen,et al.  A Comparison of Algorithms for the Maximum Clique Problem , 1992 .

[6]  Dragos Cvetkovic,et al.  A table of connected graphs on six vertices , 1984, Discret. Math..

[7]  T. Zivkovic.  On graph isomorphism and graph automorphism , 1991 .

[8]  Michael Doob,et al.  Developments in the theory of graph spectra , 1985 .

[9]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.

[10]  D. Cvetkovic,et al.  Spectra of Graphs: Theory and Applications , 1997 .

[11]  Dragos Cvetkovic,et al.  Man-Machine Theorem Proving in Graph Theory , 1988, Artif. Intell..

[12]  Dragoš Cvetković,et al.  A study of eigenspaces of graphs , 1993 .

[13]  J. Seidel.  Graphs and two-graphs , 1974 .

[14]  László Babai,et al.  On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..

[15]  Dragos Cvetkovic,et al.  on Some Algorithmic Investigations of Star Partitions of Graphs , 1995, Discret. Appl. Math..

[16]  Slobodan K. Simić,et al.  On the Largest Eigenvalue of Unicyclic Graphs , 1987 .

[17]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[18]  Uwe Schöning.  Graph Isomorphism is in the Low Hierarchy , 1988, J. Comput. Syst. Sci..

[19]  A. Kolen.  Combinatorial optimization algorithm and complexity: Prentice-Hall, Englewood Cliffs, 1982, 496 pages, $49.50 , 1983 .

[20]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[21]  Willem H. Haemers,et al.  Strongly regular graphs with strongly regular decomposition , 1989 .