In this paper, from the viewpoint of quandle construction we prove that for any link type L and any diagram of it, there exists another diagram of L such that these two diagrams are Ω1-dependent, Ω2-dependent and Ω3-dependent. [ABSTRACT FROM AUTHOR]
The present paper is an introduction to a combinatorial theory arising as a natural generalization of classical and virtual knot theory. There is a way to encode links by a class of "realizable" graphs. When passing to generic graphs with the same equivalence relations we get "graph-links". On one hand graph-links generalize the notion of virtual link, on the other hand they do not detect link mutations. We define the Jones polynomial for graph-links and prove its invariance. We also prove some a generalization of the Kauffman–Murasugi–Thistlethwaite theorem on "minimal diagrams" for graph-links. [ABSTRACT FROM AUTHOR]