Related papers: Invariants of Spatial Graphs
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…
In loop quantum gravity, states of quantum geometry are represented by classes of knotted graphs, equivalent under diffeomorphisms. Thus, it is worthwhile to enumerate and distinguish these classes. This paper looks at the case of 4-regular…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
A polynomial invariant of virtual links, arising from an invariant of links in thickened surfaces introduced by Jaeger, Kauffman, and Saleur, is defined and its properties are investigated. Examples are given that the invariant can detect…
This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, and Kaufman two-variable polynomial, Khovanov homology, factorizability of the polynomials, and…
We construct new invariant polynomial for long virtual knots. It is a generalization of Alexander polynomial. We designate it by $\zeta$ meaning an analogy with $\zeta$-polynomial for virtual links. A degree of $\zeta$-polynomial estimates…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
Recently, Bigelow defined a diagrammatic method for calculating the Alexander polynomial of a knot or link by resolving crossings in a planar algebra. I will present my multivariate version of Bigelow's calculation. The advantage to my…
In 1993, Fenn, Rourke and Sanderson introduced rack spaces and rack homotopy invariants, and modifications to quandle spaces and quandle homotopy invariants were introduced by Nosaka in 2011. In this paper, we define the Cayley-type graph…
This article surveys many aspects of the theory of quandles which algebraically encode the Reidemeister moves. In addition to knot theory, quandles have found applications in other areas which are only mentioned in passing here. The main…
We study rack polynomials and the link invariants they define. We show that constant action racks are classified by their generalized rack polynomials and show that $ns^at^a$-quandles are not classified by their generalized quandle…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
In [3] we constructed the parity-biquandle bracket valued in {\em pictures} (linear combinations of $4$-valent graphs). We gave no example of classical links such that the parity-biquandle bracket of which is not trivial. In the present…
Picture-valued invariants are the main achievement of parity theory by V.O. Manturov. In the paper we give a general description of such invariants which can be assigned to a parity (in general, a trait) on diagram crossings. We distinguish…
Invariant manifolds provide the geometric structures for describing and understanding dynamics of nonlinear systems. The theory of invariant manifolds for both finite and infinite dimensional autonomous deterministic systems, and for…