arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.2717math.COcs.DMmath.MG
收藏

推广最短路和阻力距离的一类图测距离

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

Pavel Chebotarev

摘要:

提出了一类新的图的顶点距离。此类包含可简化为最短路径、加权最短路径和族参数限制值处的电阻距离的距离参数族。这个类的主要性质是它包含的所有距离都是图测地的:$d(i,j)+d(j,k)=d(i,k)$当且仅当从$i$到$k$的每条路径都经过$j$。该类的构造是基于矩阵森林定理和转移不等式。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑