Dualizability and graph algebras

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).

• Type: Journal
• Year: 2000
• Where: DM
• Authors: Brian A. Davey, Pawel M. Idziak, William A. Lampe, George F. McNulty
• Keywords: DM 2000, Finite Graph Algebra