A Construction of Smooth Travel Groupoids on Finite Graphs

Diogo Kendy Matsumoto, Atsuhiko Mizusawa

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    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 Nebeský’s question, “Does there exist a connected graph G such that G has no smooth travel groupoid?”, in finite cases.

    Original languageEnglish
    JournalGraphs and Combinatorics
    DOIs
    Publication statusAccepted/In press - 2015 Sep 30

      Fingerprint

    Keywords

    • Finite graph
    • Smooth travel groupoid
    • Spanning tree
    • Travel groupoid

    ASJC Scopus subject areas

    • Discrete Mathematics and Combinatorics
    • Theoretical Computer Science

    Cite this