Related papers: On Kirchhoff index and number of spanning trees of…
We consider the Peano curve separating a spanning tree from its dual spanning tree on an embedded planar graph, where the tree and dual tree are weighted by $y$ to the number of active edges, and "active" is in the sense of the Tutte…
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate achemical compound's molecular graph with experimentally gathered data regarding the compound's…
The Wiener polarity index of a graph is defined as the number of unordered pairs of vertices at distance three. In recent years, this topological index was extensively studied since it has many known applications in chemistry and also in…
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem: - We give a greedy algorithm…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
The Kirchhoff index $Kf(G)$ of a graph $G$ is the sum of resistance distances between all unordered pairs of vertices, which was introduced by Klein and Randi\'c. In this paper we characterized all extremal graphs with Kirchhoff index among…
In this paper we give a linear time algorithm for computing the number of spanninig trees in double nested graphs.
\ \ We have recently developed methods for obtaining exact two-point resistance of the complete graph minus $N$ edges. We use these methods to obtain closed formulas of certain trigonometrical sums that arise in connection with…
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…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
Using a generating function approach, the correlation coefficients of four different graph-theoretical indices, namely the number of independent vertex subsets, the number of matchings, the number of subtrees and the Wiener index, are…
In this note, we introduce a new topological index of a graph G that we term peripheral hyper-Wiener index, denoted PWW(G). It is a natural extension of the peripheral Wiener index PW(G) initiated in [NB17] and is to the peripheral Wiener…
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…
We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…
In this article, we determine the maximum Wiener indices of unicyclic graphs with given number of vertices and matching number. We also characterize the extremal graphs. This solves an open problem of Du and Zhou.
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…
In 1997 Klav\v{z}ar and Gutman suggested a generalization of the Wiener index to vertex-weighted graphs. We minimize the Wiener index over the set of trees with the given vertex weights' and degrees' sequences and show an optimal tree to be…
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…
Visibility graphs are spatial interpretations of time series. When derived from the time evolution of physical systems, the graphs associated with such series may exhibit properties that can reflect aspects such as ergodicity, criticality,…