A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is either complete or bipartite complete (or a single point).doi:10.1016/s0012-365x(99)00225-3 fatcat:aevgi4zhd5fatggww5p2cmes5y