A bracket polynomial for graphs. III. Vertex weights
Abstract
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.
Keywords
Cite
@article{arxiv.0905.4879,
title = {A bracket polynomial for graphs. III. Vertex weights},
author = {Lorenzo Traldi},
journal= {arXiv preprint arXiv:0905.4879},
year = {2009}
}
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