Bicyclic graphs with extremal cover cost

被引：3

作者：

Lu, Jian ^{[1
]}

Pan, Xiang-Feng ^{[2
]}

Liu, Huiqing ^{[1
]}

机构：

[1] Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Hubei, Peoples R China

[2] Anhui Univ, Sch Math Sci, Hefei 230601, Anhui, Peoples R China

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2021年 / 405卷

关键词：

Bicyclic graph; Expected hitting time; Cover cost;

D O I：

10.1016/j.amc.2021.126235

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The expected hitting time H-xy is the expected number of steps it takes for a random walk that starts at x to reach y . For a vertex x of G, the cover cost of x, denoted by CCG(x), is defined as the sum of the expected hitting time for a random walk starting at x to visit all vertices of G . In this paper, we first reveal a close connection between the cover cost and some related graph invariants of bicyclic graphs, and then present sharp bounds of CCG(x) among all bicyclic graphs of order n and characterize the corresponding extremal graphs. (C) 2021 Elsevier Inc. All rights reserved.

引用

页数：10