Characterization of travel groupoids by partition systems on graphs

DOI10.7858/EAMJ.2019.003MaRDI QIDQ5205230zbMATH OpenFDO

Authors Jeongmi Park, Jung R. Cho

Publication date 10 December 2019

zbMATH Keywords

neighborhood systemtravel groupoidpartition system

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Sets with a single binary operation (groupoids) (20N02)

Recommendations

• Travel groupoids
• T-neighbor systems and travel groupoids on a graph
• Travel groupoids on infinite graphs.
• Groupoids assigned to relational systems.
• Characterizations of the simple non-confusing travel groupoids on a finite graph

Cites work

• A construction of smooth travel groupoids on finite graphs
• 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
• T-neighbor systems and travel groupoids on a graph
• The Non-confusing Travel Groupoids on a Finite Connected Graph
• Travel groupoids
• Travel groupoids on infinite graphs.

Cited in

(2)

• T-neighbor systems and travel groupoids on a graph
• The Non-confusing Travel Groupoids on a Finite Connected Graph

This page was built for publication: Characterization of travel groupoids by partition systems on graphs

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