Inverse of the distance matrix of a cycle-clique graph
被引:14
|
作者:
Hou, Yaoping
论文数: 0引用数: 0
h-index: 0
机构:
Hunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
Hunan First Normal Univ, Dept Math, Changsha, Hunan, Peoples R ChinaHunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
Hou, Yaoping
[1
,2
]
Fang, Aixiang
论文数: 0引用数: 0
h-index: 0
机构:
Hunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R ChinaHunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
Fang, Aixiang
[1
]
Sun, Yajing
论文数: 0引用数: 0
h-index: 0
机构:
Hunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R ChinaHunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
Sun, Yajing
[1
]
机构:
[1] Hunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
[2] Hunan First Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
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) not equal 0 if all cycle blocks have odd vertices. In this paper we give the formula for the inverse of D. (C) 2015 Elsevier Inc. All rights reserved.
机构:
Peking Univ, Sch Math Sci, Beijing 100871, Peoples R China
Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R ChinaPeking Univ, Sch Math Sci, Beijing 100871, Peoples R China
机构:
Hunan First Normal Univ, Dept Math, Changsha 410205, Hunan, Peoples R ChinaHunan First Normal Univ, Dept Math, Changsha 410205, Hunan, Peoples R China
Hou, Yaoping
Chen, Jing
论文数: 0引用数: 0
h-index: 0
机构:
Hunan First Normal Univ, Dept Math, Changsha 410205, Hunan, Peoples R ChinaHunan First Normal Univ, Dept Math, Changsha 410205, Hunan, Peoples R China