论文部分内容阅读
Let D(G) = (di,j)n×n denote the distance matrix of a connected graph G with order n,where dij is equal to the distance between vi and vj in G.The largest eigenvalue of D(G) is called the distance spectral radius of graph G,denoted by (ρ)(G).