Graph algebras and graph varieties (Q2277500): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Reinhard Pöschel / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Tamás Schmidt / rank
Normal rank
 
Property / author
 
Property / author: Reinhard Pöschel / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Tamás Schmidt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:16, 21 June 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
    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
    0 references
    directed graph
    0 references
    graph algebra
    0 references
    graph variety
    0 references
    0 references