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
AbstractA universal algebra A is coconnected if every homomorphism from A2 to A is essentially at mo...
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractA problem proposed by G. Birkhoff concerns the relation between finite lattices and unorient...
summary:One of the main aims of the present and the next part [15] is to show that the theory of gra...
AbstractFor a finite multigraph G, let Λ(G) denote the lattice of integer flows of G – this is a fin...
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...
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
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...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
AbstractWe prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M...
We compute the monoid V (LK(E)) of isomorphism classes of finitely generated projective modules ove...
AbstractIt is shown that two triply connected graphs are isomorphic if their associated geometric la...
AbstractA universal algebra A is coconnected if every homomorphism from A2 to A is essentially at mo...
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractA problem proposed by G. Birkhoff concerns the relation between finite lattices and unorient...
summary:One of the main aims of the present and the next part [15] is to show that the theory of gra...
AbstractFor a finite multigraph G, let Λ(G) denote the lattice of integer flows of G – this is a fin...
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...
Two finitely generated monoids are constructed, one finitely presented, the other not, whose (direct...
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...
summary:In the present paper we generalize a few algebraic concepts to graphs. Applying this graph l...
AbstractWe prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M...
We compute the monoid V (LK(E)) of isomorphism classes of finitely generated projective modules ove...
AbstractIt is shown that two triply connected graphs are isomorphic if their associated geometric la...
AbstractA universal algebra A is coconnected if every homomorphism from A2 to A is essentially at mo...
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...