Related papers: On electric resistances for distance-regular graph…
Characterizations graphs of some classes to induce periodic Grover walks have been studied for recent years. In particular, for the strongly regular graphs, it has been known that there are only three kinds of such graphs. Here, we focus on…
By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using L^p Wasserstein distances between probability measures, we define the corresponding spectral distances d_p on the set of all graphs.…
Let $X$ be a graph with adjacency matrix $A$. The \textsl{continuous quantum walk} on $X$ is determined by the unitary matrices $U(t)=\exp(itA)$. If $X$ is the complete graph $K_n$ and $a\in V(X)$, then \[1-|U(t)_{a,a}|\le2/n. \] In a…
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…
In network theory, the concept of effective resistance is a distance measure on a graph that relates the global network properties to individual connections between nodes. In addition, the Kron reduction method is a standard tool for…
Let $G$ be a finite, connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The remoteness $\rho(G)$ and the proximity $\pi(G)$ of $G$ are the maximum and…
A connected graph $\G$ is called {\em nicely distance--balanced}, whenever there exists a positive integer $\gamma=\gamma(\G)$, such that for any two adjacent vertices $u,v$ of $\G$ there are exactly $\gamma$ vertices of $\G$ which are…
This article discusses a geometric perspective on the well-known fact in graph theory that the effective resistance is a metric on the nodes of a graph. The classical proofs of this fact make use of ideas from electrical circuits or random…
In this paper we show that certain almost distance-regular graphs, the so-called $h$-punctually walk-regular graphs, can be characterized through the cospectrality of their perturbed graphs. A graph $G$ with diameter $D$ is called…
We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly $\ell$-walk-regular with $\ell >1$ if the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two…
We argue, for a wide class of systems including graphene, that in the low temperature, high density, large separation and strong screening limits the drag resistivity behaves as d^{-4}, where d is the separation between the two layers. The…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. This note is about the energy of regular graphs. It is shown that graphs that are close to regular can be made regular with a negligible…
We consider a parabolic obstacle problem for Euler's elastic energy of graphs with fixed ends. We show global existence, well-posedness and subconvergence provided that the obstacle and the initial datum are suitably 'small'. For symmetric…
A connected graph $G$ of diameter ${\rm diam}(G) \ge \ell$ is $\ell$-distance-balanced if $|W_{xy}|=|W_{yx}|$ for every $x,y\in V(G)$ with $d_{G}(x,y)=\ell$, where $W_{xy}$ is the set of vertices of $G$ that are closer to $x$ than to $y$.…
The diameter of a graph is the maximum distance among all pairs of vertices. Thus a graph $G$ has diameter $d$ if any two vertices are at distance at most $d$ and there are two vertices at distance $d$. We are interested in studying the…
This paper presents an introduction and expository account of a beautiful, current, and active application of recursions to the computation of resistance distance. Resistance distance, also referred to as effective resistance, is a…
In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…