Lorenzo Traldi
Published 2009-05-29, updated 2009-11-16Version 3
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simplify the computation of this weighted bracket for graphs that contain twin vertices or are constructed using graph composition, and we show that graph composition corresponds to the construction of a link diagram from tangles.
Comments: 30 pages, 14 figures. Versions v2 and v3 include corrections, new references to the literature and changes in notation. Further changes may be made before publication in the Journal of Knot Theory and its Ramifications
Multi-crossing Number for Knots and the Kauffman Bracket Polynomial
On two categorifications of the arrow polynomial for virtual knots
Pseudo links in handlebodies
![QR code for arXiv:0905.4879 [math.GT]](http://oss.arxitics.com/images/favicon.svg)