The Hitting Times of Random Walks on Bicyclic Graphs

被引：5

作者：

Zhu, Xiaomin ^{[1
]}

Zhang, Xiao-Dong ^{[1
]}

机构：

[1] Shanghai Jiao Tong Univ, SHL MAC, MOE LSC, Sch Math Sci, 800 Dongchuan Rd, Shanghai 200240, Peoples R China

来源：

GRAPHS AND COMBINATORICS | 2021年 / 37卷 / 06期

基金：

中国国家自然科学基金;

关键词：

Hitting time; Bicyclic graph; Random walk; COVER COST; RESISTANCE; INVARIANTS;

D O I：

10.1007/s00373-021-02360-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let HG(x, y) be the expected hitting time from vertex x to vertex y for the first time on a simple connected graph G and phi(G) := max{H-G(x, y) : x, y is an element of V(G)} be called the hitting time of G. In this paper, sharp upper and lower bounds for phi(G) among all n-vertex bicyclic graphs are presented and the extremal graphs are determined.

引用

页码：2365 / 2386

页数：22

共 30 条

[1] HITTING TIMES FOR RANDOM-WALKS ON VERTEX-TRANSITIVE GRAPHS [J].