Sciweavers

DM
2000

Dualizability and graph algebras

13 years 3 months ago
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).
Brian A. Davey, Pawel M. Idziak, William A. Lampe,
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2000
Where DM
Authors Brian A. Davey, Pawel M. Idziak, William A. Lampe, George F. McNulty
Comments (0)