The Non-confusing Travel Groupoids on a Finite Connected Graph

DOI10.1007/978-3-319-13287-7_2zbMath1456.05073arXiv1512.00363OpenAlexW171132834MaRDI QIDQ2945660

Yoshio Sano, Jeongmi Park, Jung Rae Cho

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.00363

zbMATH Keywords

spanning treetravel groupoidgeodetic graphconfusing pairnon-confusing travel groupoid

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Sets with a single binary operation (groupoids) (20N02)

Related Items (4)

A construction of smooth travel groupoids on finite graphs ⋮ Unnamed Item ⋮ T-neighbor systems and travel groupoids on a graph ⋮ Characterizations of the simple non-confusing travel groupoids on a finite graph

Cites Work

• Unnamed Item
• New proof of a characterization of geodetic graphs
• On signpost systems and connected graphs
• Travel groupoids
• An algebraic characterization of geodetic graphs

This page was built for publication: The Non-confusing Travel Groupoids on a Finite Connected Graph