Related papers: Spanning Forests of a Digraph and Their Applicatio…
Spanning trees are fundamental for efficient communication in networks. For fault-tolerant communication, it is desirable to have multiple spanning trees to ensure resilience against failures of nodes and edges. To this end, various notions…
For an indifference graph $G$ we define a symmetric function of increasing spanning forests of $G$. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting.…
In this paper, we consider circulant graphs obtained from the complete graph $K_N$ by deleting all edges belonging to a prescribed distance class. We study, in a unified manner, the effective resistance, the expected hitting time, the…
We provide a new approach for proving the indistinguishability of connected components of random one-or-two-ended oriented forests on unimodular random graphs. In particular, this approach leads to a new and simpler proof for the wired…
We investigate generalized inverses of matrices associated with two classes of digraphs: double star digraphs and D-linked stars digraphs. For double star digraphs, we determine the Drazin index and derive explicit formulas for the Drazin…
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let $(X,Y)$ be the bipartition of the complete bipartite graph $K_{m,n}$ with…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…
By using biclique partitions of digraphs, this paper gives reduction formulas for the number of oriented spanning trees, stationary distribution vector and Kemeny's constant of digraphs. As applications, we give a method for enumerating…
In this paper, we study the complexity of two types of digraph packing problems: perfect out-forests problem and Steiner cycle packing problem. For the perfect out-forest problem, we prove that it is NP-hard to decide whether a given strong…
A spanning 2-forest separating vertices $u$ and $v$ of an undirected connected graph is a spanning forest with 2 components such that $u$ and $v$ are in distinct components. Aside from their combinatorial significance, spanning 2-forests…
In this paper we examine the classes of graphs whose $K_n$-complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $H$ of $K_n$, the $K_n$-complement of $H$ is the graph…
The diagonal entries of pseudoinverse of the Laplacian matrix of a graph appear in many important practical applications, since they contain much information of the graph and many relevant quantities can be expressed in terms of them, such…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arborescences spanning the set of vertices reachable from each root.…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…
We present new short proofs of known spanning tree enumeration formulae for threshold and Ferrers graphs by showing that the Laplacian matrices of such graphs admit triangular rank-one perturbations. We then characterize the set of graphs…
Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…