TY - JOUR
T1 - A Construction of Smooth Travel Groupoids on Finite Graphs
AU - Matsumoto, Diogo Kendy
AU - Mizusawa, Atsuhiko
PY - 2015/9/30
Y1 - 2015/9/30
N2 - 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 Nebeský’s question, “Does there exist a connected graph G such that G has no smooth travel groupoid?”, in finite cases.
AB - 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 Nebeský’s question, “Does there exist a connected graph G such that G has no smooth travel groupoid?”, in finite cases.
KW - Finite graph
KW - Smooth travel groupoid
KW - Spanning tree
KW - Travel groupoid
UR - http://www.scopus.com/inward/record.url?scp=84944536284&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944536284&partnerID=8YFLogxK
U2 - 10.1007/s00373-015-1630-6
DO - 10.1007/s00373-015-1630-6
M3 - Article
AN - SCOPUS:84944536284
SN - 0911-0119
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
ER -