A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS

From MaRDI portal
Publication:3000673

DOI10.1142/S0218216511008875zbMATH Open1218.57010arXiv0905.4879MaRDI QIDQ3000673FDOQ3000673

L. Traldi

Publication date: 19 May 2011

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

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.


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





Cites Work


Cited In (4)


   Recommendations





This page was built for publication: A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS

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