Graph algebras and graph varieties (Q2277500): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3765838 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Varieties of relation algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3689235 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The smallest graph variety containing all paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Murskii's algebra does not satisfy min / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the variety generated by Murskiĭ's algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3757943 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the calculus of relations / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01189000 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2065983796 / rank | |||
Normal rank |
Latest revision as of 11:16, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graph algebras and graph varieties |
scientific article |
Statements
Graph algebras and graph varieties (English)
0 references
1990
0 references
Let \(G=(V,E)\) be a directed graph without multiple edges, V denotes the set of vertices, E is the set of edges. Let \(\infty\) be an adjoined element. The operation \(a,b=a\) if (a,b)\(\in E\) and \(a,b=\infty\) otherwise defines the graph algebra on \(V\cup \{\infty \}\). The author proves a ``Birkhoff-type'' theorem: a class of finite directed graphs is a graph variety iff it is closed with respect to finite restricted pointed subproducts and isomorphic copies. Several applications are given.
0 references
directed graph
0 references
graph algebra
0 references
graph variety
0 references