Title of article
Knots and graphs
Author/Authors
B.I. Kurpita، نويسنده , , K. Murasugi and A. Stoimenow، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 1998
Pages
21
From page
623
To page
643
Abstract
We examine how graphs and techniques from graph theory can be transferred into knot theory. In particular, we look at how a certain graph polynomial may be used to calculate the braid index, minimum crossing number of specific knots and links. We also show how the graph polynomial is related to recent knot invariants, most significantly, the skein polynomial.
Journal title
Chaos, Solitons and Fractals
Serial Year
1998
Journal title
Chaos, Solitons and Fractals
Record number
899002
Link To Document