A tree as a finite nonempty set with a binary operation

Title:

A tree as a finite nonempty set with a binary operation

Creator:

Nebeský, Ladislav

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:cca59995-13d5-44c9-b997-b35d00d4ad39
uuid:cca59995-13d5-44c9-b997-b35d00d4ad39
doi:10.21136/MB.2000.126275

Subject:

trees, geodetic graphs, and binary operations

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

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).

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

455-458

Source:

Mathematica bohemica | 2000 Volume:125 | Number:4

Harvested from:

CDK

Metadata only:

false