Related papers: Effective Resistances, Kirchhoff index and Admissi…
Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$…
An explicit formula for the resistance between two nodes in a network with a non-symmetric Laplacian matrix L is obtained. This is of great advantage e.g. in electronic circuit fault analysis, where non-linear systems have to be solved…
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…
We consider dynamical systems on a finite measure space fulfilling a spectral gap property and Birkhoff sums of a non-negative, non-integrable observable. For such systems we generalize strong laws of large numbers for intermediately…
Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant…
We compute the (three) master integrals for the crossed ladder diagram with two exchanged quanta of equal mass. The differential equations obeyed by the master integrals are used to generate power series expansions centered around all the…
The spectrum of Laplacian and signless Laplacian matrix for a graph product is obtained, where both underlying graphs are regular. As an application of this, we have been able to generate the Kirchhoff Index and Wiener Index and determine…
$ \def\vecc#1{\boldsymbol{#1}} $We design a polynomial time algorithm that for any weighted undirected graph $G = (V, E,\vecc w)$ and sufficiently large $\delta > 1$, partitions $V$ into subsets $V_1, \ldots, V_h$ for some $h\geq 1$, such…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…
Assessing and improving the robustness of a graph $G$ are critical steps in network design and analysis. To this end, we consider the optimisation problem of removing $k$ edges from $G$ such that the resulting graph has minimal robustness,…
In this note we consider the bent linear 2-tree and provide an explicit formula for the resistance distance $r_{G_n}(1,n)$ between the first and last vertices of the graph. We call the graph $G_n$ with vertex set $V(G_n) = \{ 1, 2, \ldots,…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
The notion of resistance distance, introduced by Klein and Randi\'c, has become a fundamental concept in spectral graph theory and network analysis, as it captures both the structural and electrical properties of a graph. The associated…
Simplifications of a result from a prior paper concerning the electric resistance between points in a distance-regular graph are given. In particular, we prove that the maximal resistance between points is bounded by twice the resistance…
To quantify the fundamental evolution of time-varying networks, and detect abnormal behavior, one needs a notion of temporal difference that captures significant organizational changes between two successive instants. In this work, we…
We find closed form formulas for the Kemeny's constant and the Kirchhoff index for the cluster $G_1\{G_2\}$ of two highly symmetric graphs $G_1$, $G_2$, in terms of the parameters of the original graphs. We also discuss some necessary…
In this paper we deal with the notion of the effective impedance of AC networks consisting of resistances, coils and capacitors. Mathematically such a network is a locally finite graph whose edges are endowed with complex-valued weights…
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…
The average effective resistance of a graph is a relevant performance index in many applications, including distributed estimation and control of network systems. In this paper, we study how the average resistance depends on the graph…