Expected hitting times for random walks on the k-triangle graph and their applications

Abstract

Given a simple connected graph G, the k-triangle graph of G, written by Tk(G), is obtained from G by adding k new vertices ui1,ui2,…,uik for each edge ei=uv in G and then adding in edges uui1,uui2,…,uuik and ui1v,ui2v,…,uikv. In this paper, the eigenvalues and eigenvectors of the probability transition matrix of random walks on Tk(G) are completely determined. Then the expected hitting times between any two vertices of Tk(G) are given in terms of those of G. Using these results all the relationship on the number of spanning trees (resp. Kemeny’s constant, the degree-Kirchhoff index) in Tk(G) compared to those of G is found. As well the resistance distance between any two vertices of Tk(G) is given with respect to those of G.