A tree as a finite nonempty set with a binary operation

DOI10.21136/MB.2000.126275MaRDI QIDQ2713706zbMATH OpenFDO

Authors Ladislav Nebeský

Publication date 10 June 2001

Published in Mathematica Bohemica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/226136

zbMATH Keywords

treesbinary operationsgeodetic graphs

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Sets with a single binary operation (groupoids) (20N02)

Cited in

(18)

• Travel groupoids
• Travel groupoids on complete multipartite graphs
• Characterizations of the simple non-confusing travel groupoids on a finite graph
• Characterization of travel groupoids by partition systems on graphs
• Intervals and steps in a connected graph
• A construction of smooth travel groupoids on finite graphs
• Associative triples and homomorphisms between travel groupoids on finite geodetic graphs
• scientific article; zbMATH DE number 475613 (Why is no real title available?)
• On Properties of a Graph that Depend on its Distance Function
• Signpost systems and spanning trees of graphs
• Idempotent elements in binary and s-ary magma monoids
• scientific article; zbMATH DE number 844505 (Why is no real title available?)
• Travel groupoids on infinite graphs.
• scientific article; zbMATH DE number 3843807 (Why is no real title available?)
• A monoid structure on the set of all binary operations over a fixed set
• Guides and shortcuts in graphs
• The Non-confusing Travel Groupoids on a Finite Connected Graph
• New proof of a characterization of geodetic graphs

This page was built for publication: A tree as a finite nonempty set with a binary operation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2713706)