报告摘要：
| This talk is interested in characterizing the relationshipbetween hitting times of the simple random walk on a graph, the Kirchhoff index, resistance-centrality, and related invariants of graphs.Georgakopoulosand Wagner [Journal of Graph Theory,84(2017),no. 3,311–326] gave a close connection between hitting times of the simple random walk on a graph, the Wiener index, and related graph invariants in the case of trees. As a continuance of it,combining with the graph transformations and some other techniques, sharp upper and lower bounds on the cover cost (resp. reverse cover cost) of a vertex in ann-vertex unicyclic graph are determined. All the corresponding extremal graphs are identified, respectively.
|
