Related papers: The corolla polynomial: a graph polynomial on half…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks…
Given graphs $X$ and $Y$, we define two conic feasibility programs which we show have a solution over the completely positive cone if and only if there exists a homomorphism from $X$ to $Y$. By varying the cone, we obtain similar…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
This paper discusses ways to categorify chromatic, dichromatic and Penrose polynomials, including categorifications of integer evaluations of chromatic polynomials. We show that with an appropriate choice of variables the coefficients of…
$\omega$-periodic graphs are introduced and studied. These are graphs which arise as the limits of periodic extensions of the nearest neighbor graph on the integers. We observe that all bounded degree $\omega$-periodic graphs are ameanable.…
The occupancy fraction of a graph is a (normalized) measure on the size of independent sets under the hard-core model, depending on a variable (fugacity) $\lambda.$ We present a criterion for finding the graph with minimum occupancy…
We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
We propose a novel fermionic model on the graphs. The Dirac operator of the model consists of deformed incidence matrices on the graph and the partition function is given by the inverse of the graph zeta function. We find that the…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We find new properties of the topological transition polynomial of embedded graphs, $Q(G)$. We use these properties to explain the striking similarities between certain evaluations of Bollob\'as and Riordan's ribbon graph polynomial,…
Distinctive power of the alliance polynomial has been studied in previous works, for instance, it has been proved that the empty, path, cycle, complete, complete without one edge and star graphs are characterized by its alliance polynomial.…
Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
The method of regions, which provides a systematic approach for computing Feynman integrals involving multiple kinematic scales, proposes that a Feynman integral can be approximated and even reproduced by summing over integrals expanded in…
In this paper, we give a characterization for a class of edge-transitive Cayley graphs, and provide methods for constructing Cayley graphs with certain symmetry properties. Also this study leads to construct and characterise a new family of…
In this article, we mainly obtain the Riemann-Hurwitz theorems for harmonic morphisms on (vertex-weighted) metric graphs or metrized complexes of algebraic curves, inspired of the recent work on harmonic morphisms of graphs or metrized…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.