Let G be a connected graph with adjacency matrix A(G) and distance matrix D(G). The adjacency-distance matrix of G is defined as S(G)=D(G)+A(G). In this paper, S(G) is generalized by the convex...

中文翻译：

---

连通图的广义邻接距离矩阵


令 G 为邻接矩阵 A(G) 和距离矩阵 D(G) 的连通图。 G的邻接距离矩阵定义为S(G)=D(G)+A(G)。在本文中，S(G) 由凸...