T-neighbor systems and travel groupoids on a graph

DOI10.1007/s00373-017-1850-zzbMath1394.20039OpenAlexW2758682692MaRDI QIDQ1696539

Jung Rae Cho, Yoshio Sano, Jeongmi Park

Publication date: 14 February 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1850-z

zbMATH Keywords

graphtravel groupoidleft translation systemT-neighbor system

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Characterizations of the simple non-confusing travel groupoids on a finite graph

Cites Work

• A construction of smooth travel groupoids on finite graphs
• The Non-confusing Travel Groupoids on a Finite Connected Graph
• Travel groupoids
• Travel groupoids on infinite graphs

This page was built for publication: T-neighbor systems and travel groupoids on a graph