The eccentricity matrix of a connected graph G, denoted by E(G), is constructed from the distance matrix of G by keeping only the largest nonzero elements in each row and each column and setting th...

中文翻译：

---

树木偏心矩阵能量最小化

连接图 G 的偏心矩阵，表示为 E(G)，是通过仅保留每行和每列中最大的非零元素并设置 G 的距离矩阵来构造的。