A bracket polynomial for graphs. III. Vertex weights

Details A bracket polynomial for graphs. III. Vertex weights A bracket polynomial for graphs. III. Vertex weights

2009-05-29

arxiv.org/abs/0905.4879v3

Mathematics

Geometric Topology

30 pages, 14 figures. Versions v2 and v3 include corrections, new references to the literature and changes in notation. Furthe

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A bracket polynomial for graphs. III. Vertex weights does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A bracket polynomial for graphs. III. Vertex weights, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A bracket polynomial for graphs. III. Vertex weights will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527364