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

    Groupoid
    Groupoids
    Finite Graph
    Connected graph
    Graph in graph theory

    Keywords

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

    ASJC Scopus subject areas

    • Discrete Mathematics and Combinatorics
    • Theoretical Computer Science

    Cite this

    A Construction of Smooth Travel Groupoids on Finite Graphs. / Matsumoto, Diogo Kendy; Mizusawa, Atsuhiko.

    In: Graphs and Combinatorics, 30.09.2015.

    Research output: Contribution to journalArticle

    Matsumoto, Diogo Kendy ; Mizusawa, Atsuhiko. / A Construction of Smooth Travel Groupoids on Finite Graphs. In: Graphs and Combinatorics. 2015.
    @article{67bfcfa869b8443394e4a4defca0805d,
    title = "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 Nebesk{\'y}’s question, “Does there exist a connected graph G such that G has no smooth travel groupoid?”, in finite cases.",
    keywords = "Finite graph, Smooth travel groupoid, Spanning tree, Travel groupoid",
    author = "Matsumoto, {Diogo Kendy} and Atsuhiko Mizusawa",
    year = "2015",
    month = "9",
    day = "30",
    doi = "10.1007/s00373-015-1630-6",
    language = "English",
    journal = "Graphs and Combinatorics",
    issn = "0911-0119",
    publisher = "Springer Japan",

    }

    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

    JO - Graphs and Combinatorics

    JF - Graphs and Combinatorics

    SN - 0911-0119

    ER -