A construction of smooth travel groupoids on finite graphs
classification
🧮 math.CO
keywords
travelfinitesmoothalgorithmgraphgraphsgroupoidgroupoids
read the original 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.~Nebesk$\acute{\mbox{y}}$'s question, "Does there exists a connected graph $G$ such that $G$ has no smooth travel groupoid?", in finite cases.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.