In this talk, a close relation between the normalized Laplacians and the hitting time of random walks on a graph is displayed. Combining graph transformations and some other techniques, sharp upper and lower bounds on the cover cost (resp. reverse cover cost), the multiplicative degree-Kirchhoff index, the number of spanning trees of graphs are determined. All the corresponding extremal graphs are identified.

Add:Building 58, The School of Mathematics, Tianjin University Beiyangyuan Campus,

No. 135, Ya Guan Road, Jinnan District, Tianjin, PRC

Tel:022-60787827 Mail:math@tju.edu.cn