相关论文: Matrix-Forest Theorems

For any given graph $G$ consider a graph $\widetilde{G}$ which is a cone over graph $G.$ In this paper, we study two important invariants of such a cone. Namely, complexity (the number of spanning trees) and the Jacobian of a graph. We…

We study the maximum out forests of a (weighted) digraph and the matrix of maximum out forests. A maximum out forest of a digraph G is a spanning subgraph of G that consists of disjoint diverging trees and has the maximum possible number of…

We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…

For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…

Let $G$ be a connected graph and let $k$ be a positive integer. Let $T$ be a spanning tree of $G$. The leaf degree of a vertex $v\in V(T)$ is defined as the number of leaves adjacent to $v$ in $T$. The leaf degree of $T$ is the maximum leaf…

Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed…

Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$. We outline an efficient bijective proof of this theorem, by studying a canonical…

This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…

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…

For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…

Let $G$ be a graph and $T$ be a spanning tree of $G$. We use $Q(G)=D(G)+A(G)$ to denote the signless Laplacian matrix of $G$, where $D(G)$ is the diagonal degree matrix of $G$ and $A(G)$ is the adjacency matrix of $G$. The signless…

A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…

A mixed graph $M_{G}$ is the graph obtained from an unoriented simple graph $G$ by giving directions to some edges of $G$, where $G$ is often called the underlying graph of $M_{G}$. In this paper, we introduce two classes of incidence…

The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…

Let $G$ be a graph of order $n$ and let $\mathcal{L}(G,\lambda)=\sum_{k=0}^n (-1)^{k}c_{k}(G)\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ili\'{c} and Ili\'{c}'s conjecture [A. Ili\'{c}, M. Ili\'{c},…

The linear arboricity of a graph $G$, denoted by $\text{la}(G)$, is the minimum number of edge-disjoint linear forests (i.e. forests in which every connected component is a path) in $G$ whose union covers all the edges of $G$. A famous…

In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…

The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…

We consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…

For a graph $G$, let $L(G)$ and $Q(G)$ be the Laplacian and signless Laplacian matrices of $G$, respectively, and $\tau(G)$ be the number of spanning trees of $G$. We prove that if $G$ has an odd number of vertices and $\tau(G)$ is not…