Related papers: A Two-Variable Interlace Polynomial
For each graph and each positive integer $n$, we define a chain complex whose graded Euler characteristic is equal to an appropriate $n$-specialization of the dichromatic polynomial. This also gives a categorification of $n$-specializations…
We establish a relation between the Bollobas-Riordan polynomial of a ribbon graph with the relative Tutte polynomial of a plane graph obtained from the ribbon graph using its projection to the plane in a nontrivial way. Also we give a…
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…
We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…
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…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…
The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…
We introduce a modular (integral) complementary polynomial $\kappa(G;x,y)$ ($\kappa_{\mathbbm z}(G;x,y)$) of two variables of a graph $G$ by counting the number of modular (integral) complementary tension-flows (CTF) of $G$ with an…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…
In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of…
The Kauffman-Vogel polynomials are three variable polynomial invariants of $4$-valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented $4$-valent rigid vertex graphs was given by using the…
We introduce a new method to generate duality relations for correlation functions of the Potts model on planar graphs. The method extends previously known results, by allowing the consideration of the correlation function for arbitrarily…
In this article, we focus on the characteristic polynomial of a graph containingloops, but without multiple edges. We present a relationship between thecharacteristic polynomial of a graph with loops and the graph obtained byremoving all…
The ribbon group action extends geometric duality and Petrie duality by defining two embedded graphs as twisted duals precisely when they lie within the same orbit under this group action. Twisted duality yields numerous novel properties of…
Bipartite incidence graph sampling provides a unified representation of many sampling situations for the purpose of estimation, including the existing unconventional sampling methods, such as indirect, network or adaptive cluster sampling,…
Landry, Minsky and Taylor [LMT] introduced two polynomial invariants of veering triangulations -- the taut polynomial and the veering polynomial. We give algorithms to compute these invariants. In their definition [LMT] use only the upper…
In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized.
We construct a state model for the two-variable Kauffman polynomial using planar trivalent graphs. We also use this model to obtain a polynomial invariant for a certain type of trivalent graphs embedded in three-dimensional space.
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…