Travel groupoids on infinite graphs.

DOI10.1007/S10587-014-0130-9MaRDI QIDQ5496695zbMATH OpenOpenAlexFDO

Authors Jeongmi Park, Yoshio Sano, Jung R. Cho

Publication date 27 January 2015

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10338.dmlcz/144056

zbMATH Keywords

geodetic graphsinfinite graphstravel groupoids

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63) Sets with a single binary operation (groupoids) (20N02)

Recommendations

• T-neighbor systems and travel groupoids on a graph
• The Non-confusing Travel Groupoids on a Finite Connected Graph
• Travel groupoids
• A construction of smooth travel groupoids on finite graphs
• Characterizations of the simple non-confusing travel groupoids on a finite graph

Cites work

• A tree as a finite nonempty set with a binary operation
• An algebraic characterization of geodetic graphs
• New proof of a characterization of geodetic graphs
• On signpost systems and connected graphs
• Travel groupoids

Cited in

(7)

• T-neighbor systems and travel groupoids on a graph
• Characterizations of the simple non-confusing travel groupoids on a finite graph
• A construction of smooth travel groupoids on finite graphs
• The Non-confusing Travel Groupoids on a Finite Connected Graph
• Characterization of travel groupoids by partition systems on graphs
• Associative triples and homomorphisms between travel groupoids on finite geodetic graphs
• Travel groupoids on complete multipartite graphs

This page was built for publication: Travel groupoids on infinite graphs.

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