Related papers: Principal minors of tree distance matrices
We define two families of determinantal random spanning subgraphs of a finite connected graph, one supported by acyclic spanning subgraphs (spanning forests) with fixed number of connected components, the other by connected spanning…
Agreement forests continue to play a central role in the comparison of phylogenetic trees since their introduction more than 25 years ago. More specifically, they are used to characterise several distances that are based on tree…
The matrices of spanning rooted forests are studied as a tool for analysing the structure of digraphs and measuring their characteristics. The problems of revealing the basis bicomponents, measuring vertex proximity, and ranking from…
In this paper, we investigate characteristic polynomials of matrices in min-plus algebra. Eigenvalues of min-plus matrices are known to be the minimum roots of the characteristic polynomials based on tropical determinants which are designed…
A \emph{general branch-and-bound tree} is a branch-and-bound tree which is allowed to use general disjunctions of the form $\pi^{\top} x \leq \pi_0 \,\vee\, \pi^{\top}x \geq \pi_0 + 1$, where $\pi$ is an integer vector and $\pi_0$ is an…
There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
We investigate the spectral properties of balanced trees and dendrimers, with a view toward unifying and improving the existing results. Here we find a semi-factorized formula for their characteristic polynomials. Afterwards, we determine…
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…
The All Minors Matrix Tree Theorem states that the determinant of any submatrix of a matrix whose columns sum to zero can be computed as a sum over certain oriented forests. We offer a particularly short proof of this result, which amounts…
Given a rooted tree $T$ with leaves $v_1,v_2,\ldots,v_n$, we define the ancestral matrix $C(T)$ of $T$ to be the $n \times n$ matrix for which the entry in the $i$-th row, $j$-th column is the level (distance from the root) of the first…
One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…
In this talk I discuss properties of the two Symanzik polynomials which characterise the integrand of an arbitrary multi-loop integral in its Feynman parametric form. Based on the construction from spanning forests and Laplacian matrices,…
We study the problem of enumerating all rooted directed spanning trees (arborescences) of a directed graph (digraph) $G=(V,E)$ of $n$ vertices. An arborescence $A$ consisting of edges $e_1,\ldots,e_{n-1}$ can be represented as a monomial…
We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…
In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…
This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…
Employing a recent technology of tree surgery we prove a ``deletion-constriction'' formula for products of rooted spanning trees on weighted directed graphs that generalizes deletion-contraction on undirected graphs. The formula implies…
We show that the sequence of moduli of the eigenvalues of a matrix polynomial is log-majorized, up to universal constants, by a sequence of "tropical roots" depending only on the norms of the matrix coefficients. These tropical roots are…
We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…