The arithmetical structure of a simple connected graph G is a pair of positive integer sequence vectors d, r satisfying the condition of (diag(d)-A)r=0, where A is the adjacency matrix of G. Therefore, a research is to be carried out on the resistance distance matrix and the resistance distance matrix of arithmetic structure, thus obtaining the inverse of the resistance distance matrix.