Related papers: Interior polynomial for signed bipartite graphs an…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
In light of $\phi$-mapping topological current theory, the inner topological structure of Hopf invariant is investigated. It is revealed that Hopf invariant is just the winding number of Gauss mapping. According to the inner structure of…
Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector centrality invariant is defined which is motivated by the need…
Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed,…
We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite…
This is a short review article on invariants of spatial graphs, written for "A Concise Encyclopedia of Knot Theory" (ed. Adams et. al.). The emphasis is on combinatorial and polynomial invariants of spatial graphs, including the Alexander…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…
In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of…
We define a triply-graded invariant of links in a genus g handlebody, generalizing the colored HOMFLYPT (co)homology of links in the 3-ball. Our main tools are the description of these links in terms of a subgroup of the classical braid…
We explore an identity between two branching graphs and propose a physical meaning in the context of the gauge-gravity correspondence. From the mathematical point of view, the identity equates probabilities associated with $\mathbb{GT}$,…
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and 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…
We introduce a new graph polynomial in two variables. This ``interlace'' polynomial can be computed in two very different ways. The first is an expansion analogous to the state space expansion of the Tutte polynomial; the significant…
We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a…
The Links-Quivers Correspondence predicts that all the symmetric (or antisymmetric) colored HOMFLY-PT polynomials of a link can be recovered from a finite amount of data (a quiver) associated to the link. We give a new geometric proof of…
It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs…
Polyak showed that any Milnor's $\overline{\mu}$-invariant of length 3 can be represented as a combination of Conway polynomials of knots obtained by certain band sum of the link components. On the other hand, Habegger and Lin showed that…
We present a new conjectural symmetry of the colored Alexander polynomial, that is the specialization of the quantum $\mathfrak{sl}_N$ invariant widely known as the colored HOMFLY-PT polynomial. We provide arguments in support of the…