arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1712.05883math.CO
收藏

直线性2-树的阻力距离

Resistance distance in straight linear 2-trees

Wayne Barrett, Emily J. Evans, Amanda E. Francis

摘要:

我们考虑图$G_n$的顶点集为$V(G_n) = \{ 1, 2, \ldots, n\}$,且为$\{i,j\} \in E(G_n)$当且仅当$0<|i-j| \leq 2$ .我们称$G_n$为$n$顶点上的直线性2-树。利用$Δ$-Y变换和Fibonacci数与Lucas数的恒等式,我们得到了$G_n$的任意两个顶点$i$与$j$之间的电阻距离$r_{G_n}(i,j)$的显式.据我们所知,$\{G_n\}_{n=3}^\infty$是第一个非平凡的家庭与直径去$\infty$的所有电阻距离已明确计算。我们的结果也给出了直线性2-树的生成树和2-森林的数目的计算公式。我们发现$G_n$中的最大电阻距离发生在顶点1和$n$之间,最小电阻距离发生在$n$偶数的顶点$n/2$和$n/2+1$之间($n$奇数的结果类似)。因此,$r_n(1,n) \to \infty$为$n \to \infty$。此外,我们的显式公式使得有可能根据电阻距离精确地对$G_n$的非边进行排序,并且这种排序与图上距离的直观概念一致。因此,$G_n$是一个几何图,它与[6]中研究的随机几何图具有完全不同的性质。直线性2-树的这些结果以及弯曲的线性2-树的例子和经验结果的额外的图形类令人信服地表明,电阻距离不应该被视为一个可行的方法,在几何图形中的链接预测。

英文摘要:

We consider the graph $G_n$ with vertex set $V(G_n) = \{ 1, 2, \ldots, n\}$ and $\{i,j\} \in E(G_n)$ if and only if $0<|i-j| \leq 2$. We call $G_n$ the straight linear 2-tree on $n$ vertices. Using $Δ$--Y transformations and identities for the Fibonacci and Lucas numbers we obtain explicit formulae for the resistance distance $r_{G_n}(i,j)$ between any two vertices $i$ and $j$ of $G_n$. To our knowledge $\{G_n\}_{n=3}^\infty$ is the first nontrivial family with diameter going to $\infty$ for which all resistance distances have been explicitly calculated. Our result also gives formulae for the number of spanning trees and 2-forests in a straight linear 2-tree. We show that the maximal resistance distance in $G_n$ occurs between vertices 1 and $n$ and the minimal resistance distance occurs between vertices $n/2$ and $n/2+1$ for $n$ even (with a similar result for $n$ odd). It follows that $r_n(1,n) \to \infty$ as $n \to \infty$. Moreover, our explicit formula makes it possible to order the non-edges of $G_n$ exactly according to resistance distance, and this ordering agrees with the intuitive notion of distance on a graph. Consequently, $G_n$ is a geometric graph with entirely different properties than the random geometric graphs investigated in [6]. These results for straight linear 2-trees along with an example of a bent linear 2-tree and empirical results for additional graph classes convincingly demonstrate that resistance distance should not be discounted as a viable method for link prediction in geometric graphs.

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

↑