Related papers: Alexander polynomial and spanning trees
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
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…
A graph is odd if all of its vertices have odd degrees. In particular, an odd spanning tree in a connected graph is a spanning tree in which all vertices have odd degrees. In this paper we establish a unified technique to enumerate odd…
We introduce an Alexander polynomial for MOY graphs. For a framed trivalent MOY graph $\mathbb{G}$, we refine the construction and obtain a framed ambient isotopy invariant $\Delta_{(\mathbb{G},c)}(t)$. The invariant $\Delta_{(\mathbb{G},…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $\beta n$, and in the $n$-th and $(n-1)$-th power graphs of the $\beta n$-cycle are evaluated as a product of…
In this paper we give an explicit formula for the twisted Alexander polynomial of any torus link and show that it is a locally constant function on the $SL(2, \mathbb C)$-character variety. We also discuss similar things for the higher…
The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the weight of the minimum spanning tree tends to a constant,…
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number…
We consider a Gibbs distribution over all spanning trees of an undirected, edge weighted finite graph, where, up to normalization, the probability of each tree is given by the product of its edge weights. Defining the weighted degree of a…
Counting the number of spanning trees in specific classes of graphs has attracted increasing attention in recent years. In this note, we present unified proofs and generalizations of several results obtained in the 2020s. The main method is…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
The group of a nontrivial knot admits a finite permutation representation such that the corresponding twisted Alexander polynomial is not a unit.
Goda showed that the twisted Alexander polynomial can be recovered from the zeta function of a matrix-weighted graph. Motivated by this, we study transformations of weighted graphs that preserve this zeta function, introducing a notion of…
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a…
Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…
We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial, and the chromatic…
We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…
The augmentation variety of a knot is the locus, in the 3-dimensional coefficient space of the knot contact homology dg-algebra, where the algebra admits a unital chain map to the complex numbers. We explain how to express the Alexander…