Forestal algebras and algebraic forests (on a new class of weakly compact graphs)

In this paper we introduce and investigate a new class of graphs called algebraic forests for which isomorphism testing can be done in time O(n3 log n). The class of algebraic forests admits a membership test of the same complexity, it includes cographs, trees and interval graphs, and even a joint superclass of the latter two, namely, rooted directed path graphs. In fact, our class is much larger than these classes, since every graph is an induced subgraph of some algebraic forest. The key point of our approach is the study of the class of forestal cellular algebras de ned inductively from one point algebras by taking direct sums and wreath products. In fact, algebraic forests are exactly the graphs the cellular algebras of which are forestal. We prove that each weak isomorphism of two forestal algebras is induced by a strong isomorphism. This implies that all forestal algebras are compact cellular algebras and so all algebraic forests are weakly compact graphs. We also present a complete characterization of cellular algebras of disconnected graphs.

[1]  G. Tinhofer,et al.  A note on certain subpolytopes of the assignment polytope associated with circulant graphs , 1988 .

[2]  Gottfried Tinhofer,et al.  The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs , 1996, J. Algorithms.

[3]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[4]  Richard A. Brualdi,et al.  Some applications of doubly stochastic matrices , 1988 .

[5]  M. Karpinski,et al.  Compact Cellular Algebras and Permutation Groups , 1999 .

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Gottfried Tinhofer,et al.  A note on compact graphs , 1991, Discret. Appl. Math..

[8]  Gottfried Tinhofer,et al.  Strong tree-cographs are birkhoff graphs , 1989, Discret. Appl. Math..

[9]  Chris Godsil,et al.  Symmetry and eigenvectors , 1997 .

[10]  Chris Godsil,et al.  Compact graphs and equitable partitions , 1997 .

[11]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[12]  Sergei Evdokimov,et al.  On Highly Closed Cellular Algebras and Highly Closed Isomorphisms , 1998, Electron. J. Comb..

[13]  Marek Karpinski,et al.  On a New High Dimensional Weisfeiler-Lehman Algorithm , 1999 .

[14]  M. Klin,et al.  Cellular Rings and Groups of Automorphisms of Graphs , 1994 .

[15]  Ilia Ponomarenko,et al.  On Primitive Cellular Algebras , 1997 .

[16]  Kellogg S. Booth,et al.  A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.

[17]  L. Babai.  Automorphism groups, isomorphism, reconstruction , 1996 .