相关论文: Categorification of the Dichromatic Polynomial for…
The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…
A graph $G$ of order $2n$ is called degree-equipartite if for every $n$-element set $A\subseteq V(G)$, the degree sequences of the induced subgraphs $G[A]$ and $G[V(G)\setminus A]$ are the same. In this paper, we characterize all…
The neighborhood degree list (NDL) is a graph invariant that refines information given by the degree sequence and joint degree matrix of a graph and is useful in distinguishing graphs having the same degree sequence. We show that the space…
Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…
For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and…
The power graph $\mathscr{P}(G)$ of a group $G$ is defined as the simple graph with vertex set $G$, and where two distinct vertices $x$ and $y$ are joined by an edge if and only if either $x= y^k$ or $y= x^k$, $k \in \mathbb{N}$. Here we…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexity of dual-criticality testing. By the definition the problem…
For a simple graph $G$, let $\chi(G,x)$ denote the chromatic polynomial of $G$. This manuscript introduces some polynomials which are related to chromatic polynomial and their relations.
The Tutte polynomial is a powerfull analytic tool to study the structure of planar graphs. In this paper, we establish some relations between the number of clusters per bond for planar graph and its dual : these relations bring into play…
The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…
Recently, Graph Neural Networks (GNNs) have greatly advanced the task of graph classification. Typically, we first build a unified GNN model with graphs in a given training set and then use this unified model to predict labels of all the…
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the characteristic polynomial of a threshold graph from its binary sequence. Applications include…
A \emph{chromatic root} is a root of the chromatic polynomial of a graph. Any chromatic root is an algebraic integer. Much is known about the location of chromatic roots in the real and complex numbers, but rather less about their…
The Tutte polynomial is a classical invariant, important in combinatorics and statistical mechanics. An essential feature of the Tutte polynomial is the duality for planar graphs G, $T_G(X,Y)\; =\; {T}_{G^*}(Y,X)$ where $G^*$ denotes the…
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and…
For a graph $G$, a $k$-coloring $c:V(G)\to \{1,2,\ldots, k\}$ is called distinguishing, if the only automorphism $f$ of $G$ with the property $c(v)=c(f(v))$ for every vertex $v\in G$ (color-preserving automorphism), is the identity. In this…
We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…
We present exact calculations of Potts model partition functions and the equivalent Tutte polynomials for polygon chain graphs with open and cyclic boundary conditions. Special cases of the results that yield flow and reliability…
An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chv\'atal and Hammer, as well as by Henderson and Zalcstein in 1977. A threshold graph is obtained from a…