科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 NebeskA1/2's question, "Does there exist a connected graph G such that G has no smooth travel groupoid?", in finite cases.
- 出版日期2016-5
