当前位置: X-MOL 学术Linear Multilinear Algebra › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Extremal hitting times of trees with some given parameters
Linear and Multilinear Algebra ( IF 0.9 ) Pub Date : 2020-07-07 , DOI: 10.1080/03081087.2020.1789538
Huihui Zhang 1 , Shuchao Li 2
Affiliation  

Given a connected graph G=(VG,EG) with x,yVG, the hitting time HG(x,y) is defined as the expected number of steps that a simple random walk takes to go from x to y. A hitting-time-based invariant, called the ZZ index, was first proposed by Zhu and Zhang [The hitting time of random walk on unicyclic graphs. Linear Multilinear Algebra. doi:10.1080/03081087.2019.1611732] recently. It was defined to be ψ(G)=maxx,yVGHG(x,y). In this paper, some extremal problems on the ZZ index of trees with some given parameters are considered. Firstly, sharp upper and lower bounds on ψ(G) are determined, respectively, for trees with given diameter, matching number, given vertex bipartition and given pendant numbers. Secondly, ordering the n-vertex caterpillar trees with respect to their ZZ indices are established.



中文翻译:

具有某些给定参数的树的极值命中时间

给定一个连通图G=(G,G)X,是的G,击球时间HG(X,是的)定义为简单随机游走从xy的预期步数。一个基于命中时间的不变量,称为ZZ指数,由朱和张首先提出 [The hit time of random walk on unicyclic graphs。线性多线性代数。doi:10.1080/03081087.2019.1611732] 最近。它被定义为ψ(G)=最大限度X,是的GHG(X,是的).在本文中,考虑了一些给定参数的树的ZZ索引的极值问题。首先,明确的上限和下限ψ(G)分别针对具有给定直径、匹配数、给定顶点二分和给定垂饰数的树确定。其次,建立了关于它们的ZZ索引的n顶点毛虫树的排序。

更新日期:2020-07-07
down
wechat
bug