HOME WEB NEWS IMAGES CLASSIFIEDS YELLOW PAGESPOLLS - SURVEYS WIKI COUNTRIES PHOTOS US UK INDIA
Avoo.com provides meta search results from various sources

Resistance_distance


Google



1

In graph theory, the resistance distance between two vertices of a simple connected graph, G, is equal to the resistance between two equivalent points on an electrical network, constructed so as to correspond to G, with each edge being replaced by a 1 ohm resistance. It is a metric on graphs.

Contents

Definition

On a graph G, the resistance distance Ωi,j between two vertices vi and vj is defined as

\Omega_{i,j}:=\Gamma_{i,i}+\Gamma_{j,j}-\Gamma_{i,j}-\Gamma_{j,i}\,

where Γ is the Moore-Penrose inverse of the Laplacian matrix of G.

Properties of resistance distance

If i=j then

\Omega_{i,j}=0\,.

For an undirected graph

\Omega_{i,j}=\Omega_{j,i}=\Gamma_{i,i}+\Gamma_{j,j}-2\Gamma_{i,j}\,

General sum rule

For any N-vertex simple connected graph G = (VE) and arbitrary NXN matrix M:

\sum_{i,j \in V}(LML)_{i,j}\Omega_{i,j}=-2tr(ML)\,

From this generalized sum rule a number of relationships can be derived depending on the choice of M. Two of note are;

\sum_{(i,j) \in E}\Omega_{i,j}=N-1
\sum_{i

where the \lambda_{k} are the non-zero eigenvalues of the Laplacian matrix.

Relationship to the number of spanning trees of a graph

For a simple connected graph G = (VE), the resistance distance between two vertices may by expressed as a function of the set of spanning trees, T, of G as follows:

\Omega_{i,j}=\begin{cases} \frac{\left | \{t:t \in T, e_{i,j} \subseteq T\} \right \vert}{\left | T \right \vert}, & (i,j) \in E\\ \frac{\left | T^\'-T \right \vert}{\left | T \right \vert}, &(i,j) \not \in E \end{cases}

where T\' is the set of spanning trees for the graph G^\'=(V, E+e_{i,j}).

Classical mechanics

In classical mechanics, resistance distance is defined as the distance from the resistance (on a lever) to the fulcrum.

References

This article is licensed under the GNU Free Documentation License. It uses material from Wikipedia


Advertise with Us | Search Marketing | Help | Suggest a Site | Privacy Policy
© 2008 www.avoo.com. All rights reserved.