AbstractA problem proposed by G. Birkhoff concerns the relation between finite lattices and unoriented graphs. In the present paper we investigate an analogous problem concerning the relations between monounary algebras and unoriented graphs. To each monounary algebra A we assign in a natural way an unoriented graph G(A) without loops and multiple edges. We describe all monounary algebras B such that G(A) and G(B) are isomorphic. Further, we characterize all monounary algebras A having the property that whenever A1 is a monounary algebra whose unoriented graph G(A1) is isomorphic to G(A), then A1 is isomorphic to A
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
AbstractIt is shown that two triply connected graphs are isomorphic if their associated geometric la...
AbstractA problem proposed by G. Birkhoff concerns the relation between finite lattices and unorient...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
summary:One of the main aims of the present and the next part [15] is to show that the theory of gra...
Let X be a non empty set and f a map from X to X. Considering f as a 1-ary operation on X we study t...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
none3First we classify some classes of finite monunary algebras, in particular the simple ones. Then...
First we classify some classes of finite monunary algebras, in particular the simple ones. Then, for...
First we classify some classes of finite monunary algebras, in particular the simple ones. Then, for...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
AbstractIt is shown that two triply connected graphs are isomorphic if their associated geometric la...
AbstractA problem proposed by G. Birkhoff concerns the relation between finite lattices and unorient...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
summary:One of the main aims of the present and the next part [15] is to show that the theory of gra...
Let X be a non empty set and f a map from X to X. Considering f as a 1-ary operation on X we study t...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
none3First we classify some classes of finite monunary algebras, in particular the simple ones. Then...
First we classify some classes of finite monunary algebras, in particular the simple ones. Then, for...
First we classify some classes of finite monunary algebras, in particular the simple ones. Then, for...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
AbstractIt is shown that two triply connected graphs are isomorphic if their associated geometric la...