论文信息 - Inverse of the distance matrix of a cycle–clique graph

Inverse of the distance matrix of a cycle–clique graph

Abstract A connected graph G , all of whose blocks are cycles or cliques, is called a cycle–clique graph. Let D be the distance matrix of G . By a theorem of Graham et al., we have det ( D ) ≠ 0 if all cycle blocks have odd vertices. In this paper we give the formula for the inverse of D .

Yaoping Hou | Aixiang Fang | Yajing Sun

[1] Product distance matrix of a tree with matrix weights , 2015 .

[2] Ronald L. Graham,et al. On the distance matrix of a directed graph , 1977, J. Graph Theory.

[3] R. Graham,et al. Distance Matrix Polynomials of Trees , 1978 .

[4] Ravindra B. Bapat,et al. On distance matrices and Laplacians , 2005 .

[5] Ravindra B. Bapat,et al. A q-analogue of the distance matrix of a tree , 2006 .

[6] Ravindra B. Bapat,et al. Inverse of the distance matrix of a block graph , 2011 .

[7] Jing Chen,et al. Inverse of the distance matrix of a cactoid digraph , 2015 .

[8] S. Sivasubramanian. q-Analogs of distance matrices of 3-hypertrees , 2009 .