A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances

Details A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances

2008-10-15

arxiv.org/abs/0810.2717v8

Discrete Applied Mathematics 159(2011) No. 5. 295-302

Mathematics

Combinatorics

14 pages. Discrete Applied Mathematics

Scientific paper

10.1016/j.dam.2010.11.017

A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family parameters. The main property of the class is that all distances it comprises are graph-geodetic: $d(i,j)+d(j,k)=d(i,k)$ if and only if every path from $i$ to $k$ passes through $j$. The construction of the class is based on the matrix forest theorem and the transition inequality.

Affiliated with

Also associated with

No associations

Rating

A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303442