Abstract：A connected graph G， all of whose blocks are cliques or complete bipartite graphs， is called a clique-bipartite graph. Let D(G) be its distance matrix. By a theorem of Graham et al， it is proved that det(D(G))≠0 if and only if K2,2 is not a block of G in this paper. Furthermore， the formula for the determinant and inverse of D(G) are given.
李瑞红,高月凤. 团-二部图的距离矩阵的行列式和逆[J]. 华中师范大学学报(自然科学版), 2024, 58(4): 403-408.
LI Ruihong,GAO Yuefeng. The determinant and inverse of the distance matrix of clique-bipartite graph. journal1, 2024, 58(4): 403-408.
2024, Vol. 58 
