Braid presentation of spatial graphs

Ken Kanno; Kouki Taniyama

doi:10.3836/tjm/1296483485

Braid presentation of spatial graphs

Ken Kanno, Kouki Taniyama

School of Education

Research output: Contribution to journal › Article › peer-review

5 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 language	English
Pages (from-to)	509-522
Number of pages	14
Journal	Tokyo Journal of Mathematics
Volume	33
Issue number	2
DOIs	https://doi.org/10.3836/tjm/1296483485
Publication status	Published - 2010

Keywords

Braid presentation
Spatial graph

ASJC Scopus subject areas

Mathematics(all)

Access to Document

10.3836/tjm/1296483485

Fingerprint Dive into the research topics of 'Braid presentation of spatial graphs'. Together they form a unique fingerprint.

Cite this

@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",

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

Y1 - 2010

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 -

Braid presentation of spatial graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this