相关论文: Distance Hereditary Graphs and the Interlace Polyn…

The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…

For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.

The Discrepancy of a hypergraph is the minimum attainable value, over two-colorings of its vertices, of the maximum absolute imbalance of any hyperedge. The Hereditary Discrepancy of a hypergraph, defined as the maximum discrepancy of a…

We initiate the systematic study of the following Tur\'an-type question. Suppose $\Gamma$ is a graph with $n$ vertices such that the edge density between any pair of subsets of vertices of size at least $t$ is at most $1 - c$, for some $t$…

Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

The exact distance $t$-power of a graph $G$, $G^{[\sharp t]}$, is a graph which has the same vertex set as $G$, with two vertices adjacent in $G^{[\sharp t]}$ if and only if they are at distance exactly $t$ in the original graph $G$. We…

Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…

We introduce a dense counterpart of graph degeneracy, which extends the recently-proposed invariant symmetric difference. We say that a graph has sd-degeneracy (for symmetric-difference degeneracy) at most $d$ if it admits an elimination…

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…

The interlace polynomial q was introduced by Arratia, Bollobas, and Sorkin. It encodes many properties of the orbit of a graph under edge local complementation (ELC). The interlace polynomial Q, introduced by Aigner and van der Holst,…

We study the problem of approximating the value of the matching polynomial on graphs with edge parameter $\gamma$, where $\gamma$ takes arbitrary values in the complex plane. When $\gamma$ is a positive real, Jerrum and Sinclair showed that…

Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. We introduce some edge (resp. vertex)-homotopy invariants of spatial graphs by applying the Sato-Levine…

Let G(V,E) be a simple graph and let X subset of V. Two vertices u and v are said to be X-visible if there exists a shortest u,v-path P such that V(P) intersection X is a subset of {u, v}. A set X is called a mutual-visibility set of G if…

The Bollob\'as-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored…

For any graph G with n edges, the spanning subgraphs and the orientations of G are both counted by the evaluation T_G(2,2)=2^n of its Tutte polynomial. We define a bijection $\Phi$ between spanning subgraphs and orientations and explore its…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

The Tutte polynomial is originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning subgraphs, and of…

Recently O. Bernardi gave a formula for the Tutte polynomial $T(x,y)$ of a graph, based on spanning trees and activities just like the original definition, but using a fixed ribbon structure to order the set of edges in a different way for…