相关论文: Spanning Forests and the Golden Ratio

Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$…

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…

The Gallai graph $\Gamma(G)$ of a graph $G$ has the edges of $G$ as its vertices and two distinct vertices $e$ and $f$ of $\Gamma(G)$ are adjacent in $\Gamma(G)$ if the edges $e$ and $f$ of $G$ are adjacent in $G$ but do not span a triangle…

Let a network be represented by a simple graph $\mathcal{G}$ with $n$ vertices. A common approach to investigate properties of a network is to use the adjacency matrix $A=[a_{ij}]_{i,j=1}^n\in\R^{n\times n}$ associated with the graph…

A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq…

Let $G$ be a graph on $n$ vertices. The $k$-token graph (or symmetric $k$-th power) of $G$, denoted by $F_k(G)$ has as vertices the ${n\choose k}$ $k$-subsets of vertices from $G$, and two vertices are adjacent when their symmetric…

Let $G$ be a simple finite connected graph with vertex set $V(G) = \{v_1,v_2,\ldots,v_n\}$. Denote the degree of vertex $v_i$ by $d_i$ for all $1 \leq i \leq n$. The Randi\'c matrix of $G$, denoted by $R(G) = [r_{i,j}]$, is the $n \times n$…

The connective constant $\mu(G)$ of a graph $G$ is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. We investigate the validity of the inequality $\mu \ge \phi$ for infinite, transitive, simple,…

Given a subgraph $H$ of a graph $G$, the induced graph of $H$ is the largest subgraph of $G$ whose vertex set is the same as that of $H$. Our paper concerns the induced graphs of the components of $\operatorname{WSF}(G)$, the wired spanning…

A temporal graph is a graph whose edges appear at certain points in time. These graphs are temporally connected (in class TC) if all vertices can reach each other by temporal paths (traversing the edges in chronological order). Reachability…

The \textit{eccentricity matrix} $\mathcal{E}(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The…

We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…

A well-known conjecture of Richard Stanley posits that the $h$-vector of the independence complex of a matroid is a pure ${\mathcal O}$-sequence. The conjecture has been established for various classes but is open for graphic matroids. A…

A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…

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…

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…

Let $G$ be a finite simple graph with Laplacian polynomial $\psi(G,\lambda)=\sum_{k=0}^n(-1)^{n-k}c_k\lambda^k$. In an earlier paper, the coefficients $c_{n-4}$ and $c_{n-5}$ for tree with respect to some degree-based graph invariants were…

During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the…

In this paper, we aim to provide probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. These tree formulas are closely related to loop-erased…

We define the branching ratio of the input tree of a node in a finite directed multigraph, prove that it exists for every node, and show that it is equal to the largest eigenvalue of the adjacency matrix of the induced subgraph determined…