A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS

DOI10.1142/S0218216511008875MaRDI QIDQ3000673zbMATH OpenFDO

Authors L. Traldi

Publication date 19 May 2011

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

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

zbMATH Keywords

graphvirtual linkgraph compositionKauffman bracketvertex weighttwin vertex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15)

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.

Recommendations

• A bracket polynomial for graphs. I
• scientific article; zbMATH DE number 12050
• A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
• A bracket polynomial for graphs. IV: Undirected Euler circuits, graph-links and multiply marked graphs
• Weighted Tutte-Grothendieck polynomials of graphs
• ON THE VERTEX CONNECTIVITY POLYNOMIAL OF GRAPHS
• A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
• The graph polynomials and their equivalence
• Weighted graph homomorphisms and the Tutte polynomial
• The vertex degree polynomial of some graph operations

Cites work

• A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
• A Tutte polynomial for signed graphs
• A bracket polynomial for graphs. I
• A few weight systems arising from intersection graphs
• A matrix for computing the Jones polynomial of a knot
• A polynomial invariant for knots via von Neumann algebras
• A polynomial invariant of graphs on orientable surfaces
• A polynomial of graphs on surfaces
• A spanning tree expansion of the Jones polynomial
• Cycle decomposition by disjoint transpositions
• Cycle decomposition by transpositions
• Decomposition of Directed Graphs
• INTRODUCTION TO GRAPH-LINK THEORY
• Jones polynomial of knots formed by repeated tangle replacement operations
• Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory
• State models and the Jones polynomial
• THISTLETHWAITE'S THEOREM FOR VIRTUAL LINKS
• The Tutte polynomial of a ported matroid
• The interlace polynomial of a graph
• The interlace polynomial of graphs at \(-1\)
• VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
• Virtual knot theory
• Weighted interlace polynomials

Cited in

(6)

• A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
• Wiring diagrams, the \(W\)-polynomial, and determinants of links
• Graph-links: nonrealizability, orientation, and Jones polynomial
• Parity in knot theory and graph-links
• A bracket polynomial for graphs. IV: Undirected Euler circuits, graph-links and multiply marked graphs
• A bracket polynomial for graphs. I

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)