Ladislav Nebesky, Filozoficka fakulta Univerzity Karlovy, nam. J. Palacha 2, 116 38 Praha 1, Czech Republic, e-mail: ladislav.nebesky@ff.cuni.cz
Abstract: A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and let $ H(W)$ be the set of all trees $T$ with the property that $W$ is the vertex set of $T$. We will find a one-to-one correspondence between $ H(W)$ and the set of all binary operations on $W$ which satisfy a certain set of three axioms (stated in this note).
Keywords: trees, geodetic graphs, binary operations
Classification (MSC 1991): 05C05, 05C75, 20N02
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
