相关论文: Spanning Forests and the Golden Ratio

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…

The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green's functions in terms of enumerating trees and forests…

In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…

We study spanning diverging forests of a digraph and related matrices. It is shown that the normalized matrix of out forests of a digraph coincides with the transition matrix in a specific observation model for Markov chains related to the…

We introduce the concept of Most, and Least, Compact Spanning Trees - denoted respectively by $T^*(G)$ and $T^\#(G)$ - of a simple, connected, undirected and unweighted graph $G(V, E, W)$. For a spanning tree $T(G) \in \mathcal{T}(G)$ to be…

Motivated by the study of the crossing number of graphs, it is shown that, for trees, the sum of the products of the degrees of the end-vertices of all edges has an upper bound in terms of the sum of all vertex degrees to the power of…

A maximum sequence $S$ of vertices in a graph $G$, so that every vertex in $S$ has a neighbor which is independent, or is itself independent, from all previous vertices in $S$, is called a Grundy dominating sequence. The Grundy domination…

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

A matrix $S=(s_{ij})\in{\mathbb R}^{n\times n}$ is said to determine a \emph{transitional measure} for a digraph $G$ on $n$ vertices if for all $i,j,k\in\{1,\...,n\},$ the \emph{transition inequality} $s_{ij} s_{jk}\le s_{ik} s_{jj}$ holds…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

Let $G=(V,\overrightarrow{E})$ be a graph with some prescribed orientation for the edges and $\Gamma$ be an arbitrary group. If $f\in \mathrm{Inv}(\Gamma)$ be an anti-involution then the skew gain graph $\Phi_f=(G,\Gamma,\varphi,f)$ is such…

Let $G$ be a graph. Its laplacian matrix $L(G)$ is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been intensively used in spectral partitioning problems due to their good…

Let $G$ be the Cartesian product of a regular tree $T$ and a finite connected transitive graph $H$. It is shown in arXiv:2006.06387 that the Free Uniform Spanning Forest ($\mathsf{FSF}$) of this graph may not be connected, but the…

We say that a vertex $v$ in a connected graph $G$ is decisive if the numbers of walks from $v$ of each length determine the graph $G$ rooted at $v$ up to isomorphism among all connected rooted graphs with the same number of vertices. On the…

The Fiedler vector of a graph, namely the eigenvector corresponding to the second smallest eigenvalue of a graph Laplacian matrix, plays an important role in spectral graph theory with applications in problems such as graph bi-partitioning…

The forest matrix plays a crucial role in network science, opinion dynamics, and machine learning, offering deep insights into the structure of and dynamics on networks. In this paper, we study the problem of querying entries of the forest…

The induced arboricity of a graph $G$ is the smallest number of induced forests covering the edges of $G$. This is a well-defined parameter bounded from above by the number of edges of $G$ when each forest in a cover consists of exactly one…

Let $G$ be a graph on $n$ vertices. For $i\in \{0,1\}$ and a connected graph $G$, a spanning forest $F$ of $G$ is called an $i$-perfect forest if every tree in $F$ is an induced subgraph of $G$ and exactly $i$ vertices of $F$ have even…

For a graph \(G\) with no isolated vertices, its Laplacian ratio is defined as \[ \pi(G)=\frac{\operatorname{per}(L(G))}{\prod_{v\in V(G)} d(v)}, \] where \(L(G)\) is the Laplacian matrix of \(G\), \(d(v)\) is the degree of \(v\), and…

The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. It is a known result…