The Non-confusing Travel Groupoids on a Finite Connected Graph

DOI10.1007/978-3-319-13287-7_2MaRDI QIDQ2945660zbMATH OpenOpenAlexFDO

Authors Jeongmi Park, Yoshio Sano, Jung R. 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

confusing pairgeodetic graphnon-confusing travel groupoidspanning treetravel groupoid

Mathematics Subject Classification ID

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

Abstract: The notion of travel groupoids was introduced by L. Nebesk'y in 2006 in connection with a study on geodetic graphs. A travel groupoid is a pair of a set $V$ and a binary operation $\ast$ on $V$ satisfying two axioms. For a travel groupoid, we can associate a graph. We say that a graph $G$ has a travel groupoid if the graph associated with the travel groupoid is equal to $G$. Nebesk'y gave a characterization for finite graphs to have a travel groupoid. In this paper, we introduce the notion of T-partition systems on a graph and give a characterization of travel groupoids on a graph in terms of T-partition systems.

Recommendations

• Characterizations of the simple non-confusing travel groupoids on a finite graph
• Travel groupoids on infinite graphs.
• A construction of smooth travel groupoids on finite graphs
• Characterization of travel groupoids by partition systems on graphs
• T-neighbor systems and travel groupoids on a graph
• On the non-commuting graph of a group
• On the non-cyclic graph of a group
• On the non-nilpotent graphs of a group
• The generalized non-commuting graph of a finite group
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties

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

(6)

• 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
• Characterization of travel groupoids by partition systems on graphs
• Travel groupoids on infinite graphs.
• Travel groupoids on complete multipartite graphs

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

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