A construction of smooth travel groupoids on finite graphs
Abstract
A travel groupoid is an algebraic system related with graphs. In this paper, we give an algorithm to construct smooth travel groupoids for any finite graph. This algorithm gives an answer of L.~Nebesky's question, "Does there exists a connected graph G such that G has no smooth travel groupoid?", in finite cases.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.