In this article the classification of finite flat graph algebras which have finite equational bases is given in terms of omitted induced subgraphs. The result is related to an earlier result obtained for finite graph algebras by Baker, McNulty, and Werner.
β¦ LIBER β¦
Full duality among graph algebras and flat graph algebras
β Scribed by William A. Lampe; George F. McNulty; Ross Willard
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 223 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Finite Bases for Flat Graph Algebras
β
Dejan DeliΔ
π
Article
π
2001
π
Elsevier Science
π
English
β 136 KB
Graph algebras and graph varieties
β
Reinhard PΓΆschel
π
Article
π
1990
π
Springer
π
English
β 885 KB
E -Theoretic Duality for Higher Rank Gra
β
Iulian Popescu; Joachim Zacharias
π
Article
π
2005
π
Springer
π
English
β 183 KB
Graph algebras and the graph isomorphism
β
I. N. Ponomarenko
π
Article
π
1994
π
Springer
π
English
β 525 KB
Contractors and connectors of graph alge
β
LΓ‘szlΓ³ LovΓ‘sz; BalΓ‘zs Szegedy
π
Article
π
2009
π
John Wiley and Sons
π
English
β 170 KB
## Abstract We study generalizations of the βcontractionβdeletionβ relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman at al [Reflection positivity, rank connectivity, and
The Equational Logic For Graph Algebras
β
Reinhard PΓΆschel
π
Article
π
1989
π
John Wiley and Sons
π
English
β 598 KB