The field of discrete calculus, also known as" discrete exterior calculus", focuses on finding a
proper set of definitions and differential operators that make it possible to operate the …

The effective resistance between two nodes of a weighted graph is the electrical resistance
seen between the nodes of a resistor network with branch conductances given by the edge …

It is well known that the resistance distance between two arbitrary vertices in an electrical
network can be obtained in terms of the eigenvalues and eigenvectors of the combinatorial …

The resistance distance r ij between two vertices vi and vj of a (connected, molecular) graph
G is equal to the resistance between the respective two points of an electrical network …

The resistance distance between any two vertices of a connected graph is defined as the net
effective resistance between them. An electrical network can be constructed from a graph by …

The normalized Laplacian makes a great contribution on analyzing the structure properties
of nonregular graphs. Let On be a linear octagonal‐quadrilateral network. In this article, we …

Divided into five sections, this book offers 200 graph-theoretical matrices covering
adjacency and related matrices, distance and related matrices, incidence matrices, and …

The resistance distance rij between vertices i and j of a connected (molecular) graph G is
computed as the effective resistance between nodes i and j in the corresponding network …

In this paper, we give a survey of methods used to calculate values of resistance distance
(also known as effective resistance) in graphs. Resistance distance has played a prominent …

The generalized inverse L✝ of the Laplacian matrix of a connected graph is examined and
some of its properties are established. In some physical and chemical considerations the …