For some complicated graphs obtained by graph operations,it is very difficult to compute resistance distance and Kirchhoff index.Define a new graph operation,and obtain a class of new join graphs:the subdivision-verte...For some complicated graphs obtained by graph operations,it is very difficult to compute resistance distance and Kirchhoff index.Define a new graph operation,and obtain a class of new join graphs:the subdivision-vertex-vertex join G_1* G_2.Then,describe the Laplacian matrix of the graph G_1 * G_2 and use generalized inverse of the Laplacian matrix to get formulas for resistance distance and Kirchhoff index.Through the obtained formulas,the resistance distance of any pairs of vertices and Kirchhoff index of the join graph can be computed.展开更多
基金National Natural Science Foundation of China(No.11361033)
文摘For some complicated graphs obtained by graph operations,it is very difficult to compute resistance distance and Kirchhoff index.Define a new graph operation,and obtain a class of new join graphs:the subdivision-vertex-vertex join G_1* G_2.Then,describe the Laplacian matrix of the graph G_1 * G_2 and use generalized inverse of the Laplacian matrix to get formulas for resistance distance and Kirchhoff index.Through the obtained formulas,the resistance distance of any pairs of vertices and Kirchhoff index of the join graph can be computed.
