Braid presentation of spatial graphs

DOI10.3836/TJM/1296483485zbMATH Open1210.57008arXiv0901.1511OpenAlexW1974163135MaRDI QIDQ632499FDOQ632499

Authors: Ken Kanno, Kouki Taniyama 

Publication date: 25 March 2011

Published in: Tokyo Journal of Mathematics (Search for Journal in Brave)

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 not hold for spatial graphs.

Full work available at URL: https://arxiv.org/abs/0901.1511

Recommendations

• Planar graphs and presentations of braid groups
• scientific article; zbMATH DE number 591405
• Spatial graph as connected sum of a planar graph and a braid
• About presentations of braid groups and their generalizations
• Representation of links by braids: A new algorithm

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Embedding knots and links in an open book. I: Basic properties
• The minimal number of Seifert circles equals the braid index of a link
• On the braid index of?m-curve in 3-space

Cited In (6)

• Design and serial construction of digraph braids
• Alexander- and Markov-type theorems for virtual trivalent braids
• Multiplicity of a space over another space
• Handlebody-knots and development of quandle theory
• Spatial graph as connected sum of a planar graph and a braid
• The \(L\)-move and Markov theorems for trivalent braids

This page was built for publication: Braid presentation of spatial graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632499)