scientific article; zbMATH DE number 3859183
From MaRDI portal
Publication:3328587
[For the entire collection see Zbl 0523.00001.] From the text: In this note we obtain results related to iteration, decomposition and the existence of n-ary roots of transformations of finite sets using the graphs attached to these transformations. We retrieve, as special cases, certain iterative properties of switching functions.
Recommendations
Cited in
(14)- Inclusion transformations: \((n,m)\)-graphs and their classification
- Graphs of nonsingular threshold transformations
- Some properties of contractible transformations on graphs
- Using binary operations to construct a transitive set of block transformations
- Basic properties of total transformation graphs
- scientific article; zbMATH DE number 3845606 (Why is no real title available?)
- scientific article; zbMATH DE number 3869229 (Why is no real title available?)
- scientific article; zbMATH DE number 5670906 (Why is no real title available?)
- scientific article; zbMATH DE number 3896829 (Why is no real title available?)
- scientific article; zbMATH DE number 4093508 (Why is no real title available?)
- scientific article; zbMATH DE number 1245647 (Why is no real title available?)
- Structural characterizations of the path independence property for set transformations
- scientific article; zbMATH DE number 854795 (Why is no real title available?)
- On transformations of posets which have the same bound graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328587)