图的Kemeny常数和Braess边的1-分离公式
A 1-Separation Formula for the Graph Kemeny Constant and Braess Edges
摘要:
简单连通图$G$的Kemeny常数是从$i$到任意给定顶点$j \neq i$的随机游动的期望长度。本文从电网络理论出发,通过有效电阻法,给出了一种计算1-可分系统Kemeny常数的简单方法。利用这个公式,我们给出了一个简单的证明:对于$n$顶点上的无向树类,$n$顶点上的路图最大化Kemeny常数.再次应用这种方法,我们简化了现有的杠铃图的Kemeny常数的表达式,并证明杠铃最大化Kemeny常数。这个1-分离恒等式进一步允许我们为1-可分离图中Braess边的存在性创造充分条件。我们将Braess边的概念推广到Braess集,即图中的非边集合,使得它们添加到基础图中会增加Kemeny常数。本文刻画了具有任意个数的孪生悬挂顶点的图的Braess集,推广了Kirkland等人的工作. al.~ \cite{kirkland2016kemeny}和Ciardo \cite{ciardo2020braess}。
英文摘要:
Kemeny's constant of a simple connected graph $G$ is the expected length of a random walk from $i$ to any given vertex $j \neq i$. We provide a simple method for computing Kemeny's constant for 1-separable via effective resistance methods from electrical network theory. Using this formula, we furnish a simple proof that the path graph on $n$ vertices maximizes Kemeny's constant for the class of undirected trees on $n$ vertices. Applying this method again, we simplify existing expressions for the Kemeny's constant of barbell graphs and demonstrate which barbell maximizes Kemeny's constant. This 1-separation identity further allows us to create sufficient conditions for the existence of Braess edges in 1-separable graphs. We generalize the notion of the Braess edge to Braess sets, collections of non-edges in a graph such that their addition to the base graph increases the Kemeny constant. We characterize Braess sets in graphs with any number of twin pendant vertices, generalizing work of Kirkland et.~al.~\cite{kirkland2016kemeny} and Ciardo \cite{ciardo2020braess}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。