摘要
图G上顶点v的覆盖成本定义为,Hvu是从v开始随机游走到达u的平均首达时间。本文研究了给定度序列树的覆盖成本,并且刻画出覆盖成本最小的树。
The cover cost of a vertex v in G is defined as , where Hvu is the expected hitting time for random walk beginning at v to visit u. In this paper, we study the cover cost of trees and characterize the unique tree with the minimum cover cost with given degree sequence.
出处
《应用数学进展》
2021年第7期2605-2613,共9页
Advances in Applied Mathematics
