Graph-Links: Nonrealizability, Orientation, and Jones Polynomial


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The present paper is devoted to graph-links with many components and consists of two parts. In the first part of the paper we classify vertices of a labeled graph according to the component they belong to. Using this classification, we construct an invariant of graph-links. This invariant shows that the labeled second Bouchet graph generates a nonrealizable graph-link.

In the second part of the work we introduce the notion of an oriented graph-link. We define a writhe number for the oriented graph-link and we get an invariant of oriented graph-links, the Jones polynomial, by normalizing the Kauffman bracket with the writhe number.

About the authors

D. P. Ilyutko

M. V. Lomonosov Moscow State University

Author for correspondence.
Email: ilyutko@yandex.ru
Russian Federation, Moscow

V. S. Safina

M. V. Lomonosov Moscow State University

Email: ilyutko@yandex.ru
Russian Federation, Moscow


Copyright (c) 2016 Springer Science+Business Media New York

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies