To every monounary algebra \((A,f)\) a graph \(\mathcal G(A,f)=(A,E)\) is assigned where \(\{x,y\}\in E\) if and only if \(f(x)=y\) or \(f(y)=x\). Monounary algebras \((A,f)\) and \((B,g)\) are said to be equivalent with respect to graphs if the graphs \(\mathcal G(A,f)\) and \(\mathcal G(B,g)\) are isomorphic. The author describes monounary algebras equivalent to an arbitrary given monounary algebra. Monounary algebras uniquely determined by their graphs are described as well.
Recommendations
Cited in
(9)- Graphs and nonassociative algebras
- scientific article; zbMATH DE number 2185579 (Why is no real title available?)
- scientific article; zbMATH DE number 2185760 (Why is no real title available?)
- scientific article; zbMATH DE number 3843808 (Why is no real title available?)
- scientific article; zbMATH DE number 3983195 (Why is no real title available?)
- scientific article; zbMATH DE number 2059552 (Why is no real title available?)
- scientific article; zbMATH DE number 2172909 (Why is no real title available?)
- On discrete properties of Bernoulli shift
- Mono-unary algebras are uniquely determined by their lattices of fuzzy weak subalgebras
This page was built for publication: Unoriented graphs of monounary algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579560)