Related papers: Alexander polynomial and spanning trees
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
Given a homomorphism from a knot group to a fixed group, we introduce an element of a $K_1$-group, which is a generalization of (twisted) Alexander polynomials. We compare this $K_1$-class with other Alexander polynomials. In terms of…
The number of spanning trees of a graph $G$, denoted $\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\'a\v{c}ek from 1969, Chan,…
This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
Building on the approach of Bar-Natan and Van der Veen to universal knot invariants using (perturbed) Gaussian functions, we develop a Gaussian model to compute the Alexander polynomial $\Delta_{\mathcal{K}}(T)$ of an oriented knot…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of balanced spanning trees in the random geometric graph…
Cayley's formula states that there are $n^{n-2}$ spanning trees in the complete graph on $n$ vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold…
The mock Alexander polynomial is an extension of the classical Alexander polynomial, defined and studied for (virtual) knots and knotoids by the second and third authors. In this paper we consider the mock Alexander polynomial for…
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…
This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…
This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.
A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an input graph has a spanning even tree. Hofmann and Walsh…
We present a new characterization of $k$-trees based on their reduced clique graphs and $(k+1)$-line graphs, which are block graphs. We explore structural properties of these two classes, showing that the number of clique-trees of a…
In this paper, we discuss twisted Alexander polynomials of a knot for group extensions of a finite group in two directions. Firstly, we provide a mod $p$ formula for the twisted Alexander polynomial of a knot in the $3$-sphere associated…
The Alexander polynomials \Delta_{n,3}(t) and \Delta_{n,4}(t) are presented as a sum of the Alexander polynomials \Delta_{k,2}(t). These polynomials are also expressed in the form of a sum of Chebyshev polynomials of the second kind. These…
We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$-edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{\deg_G(v)}{2}\rceil + 1$.
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
We relate some terms on the boundary of the Newton polygon of the Alexander polynomial $\Delta(x,y)$ of a rational link to the number and length of monochromatic twist sites in a particular diagram that we call the standard form. Normalize…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…