Braid presentation of spatial graphs

Ken Kanno, Kouki Taniyama

    Research output: Contribution to journal › Article

    4 Citations (Scopus)

    Abstract

    We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link, it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy does nothold for spatial graphs.

    Original languageEnglish
    Pages (from-to)509-522
    Number of pages14
    JournalTokyo Journal of Mathematics
    Volume33
    Issue number2
    DOIs
    Publication statusPublished - 2010 Jan 1

    Fingerprint

    Spatial Graph
    Braid
    Oriented Graph
    Analogy
    Circle
    Presentation

    Keywords

    • Braid presentation
    • Spatial graph

    ASJC Scopus subject areas

    • Mathematics(all)

    Cite this

    Braid presentation of spatial graphs. / Kanno, Ken; Taniyama, Kouki.

    In: Tokyo Journal of Mathematics, Vol. 33, No. 2, 01.01.2010, p. 509-522.

    Research output: Contribution to journal › Article

    Kanno, K & Taniyama, K 2010, 'Braid presentation of spatial graphs', Tokyo Journal of Mathematics, vol. 33, no. 2, pp. 509-522. https://doi.org/10.3836/tjm/1296483485
    Kanno K, Taniyama K. Braid presentation of spatial graphs. Tokyo Journal of Mathematics. 2010 Jan 1;33(2):509-522. https://doi.org/10.3836/tjm/1296483485
    Kanno, Ken ; Taniyama, Kouki. / Braid presentation of spatial graphs. In: Tokyo Journal of Mathematics. 2010 ; Vol. 33, No. 2. pp. 509-522.
    @article{dd1e52d2d2a14278870b9436c205b4aa,
    title = "Braid presentation of spatial graphs",
    abstract = "We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link, it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy does nothold for spatial graphs.",
    keywords = "Braid presentation, Spatial graph",
    author = "Ken Kanno and Kouki Taniyama",
    year = "2010",
    month = "1",
    day = "1",
    doi = "10.3836/tjm/1296483485",
    language = "English",
    volume = "33",
    pages = "509--522",
    journal = "Tokyo Journal of Mathematics",
    issn = "0387-3870",
    publisher = "Publication Committee for the Tokyo Journal of Mathematics",
    number = "2",

    }

    TY - JOUR

    T1 - Braid presentation of spatial graphs

    AU - Kanno, Ken

    AU - Taniyama, Kouki

    PY - 2010/1/1

    Y1 - 2010/1/1

    N2 - We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link, it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy does nothold for spatial graphs.

    AB - We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link, it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy does nothold for spatial graphs.

    KW - Braid presentation

    KW - Spatial graph

    UR - http://www.scopus.com/inward/record.url?scp=84866935845&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84866935845&partnerID=8YFLogxK

    U2 - 10.3836/tjm/1296483485

    DO - 10.3836/tjm/1296483485

    M3 - Article

    AN - SCOPUS:84866935845

    VL - 33

    SP - 509

    EP - 522

    JO - Tokyo Journal of Mathematics

    JF - Tokyo Journal of Mathematics

    SN - 0387-3870

    IS - 2

    ER -

    Access to Document