给定度序列具有最小覆盖成本的树  

The Minimum Cover Cost of a Tree with Given Degree Sequence

作　　者：贾雁宇 李玉瑛 郝艺方 

机构地区：[1]太原理工大学数学学院,山西 晋中

出　　处：《应用数学进展》2021年第7期2605-2613,共9页Advances in Applied Mathematics

摘　　要：图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.

关 键 词：度序列 覆盖成本 贪婪树 

分 类 号：U22[交通运输工程—道路与铁道工程]