论文信息 - On mixed block graphs

On mixed block graphs

Abstract A mixed complete graph is obtained from a directed cycle of length at least three by adding all the possible arcs between any non-adjacent vertices of the underlying cycle. A mixed block graph is a strongly connected directed graph whose blocks are mixed complete graphs. In this paper, we give the inverse of the distance matrix of the mixed block graph.

Hui Zhou | Qi Ding

[1] Hui Zhou,et al. The distance matrix of a tree with weights on its arcs , 2016 .

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

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

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

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

[7] Ravindra B. Bapat,et al. The distance matrix of a bidirected tree , 2009 .

[8] Yaoping Hou,et al. Inverse of the distance matrix of a bi-block graph , 2016 .

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

[10] Yaoping Hou,et al. Inverse of the distance matrix of a cycle–clique graph , 2015 .

[11] Hui Zhou. The inverse of the distance matrix of a distance well-defined graph , 2017 .