Inverse of the distance matrix of a cycle-clique graph

被引:14
|
作者
Hou, Yaoping [1 ,2 ]
Fang, Aixiang [1 ]
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
基金
中国国家自然科学基金;
关键词
Distance matrix; Cycle; Clique; Inverse matrix; TREE;
D O I
10.1016/j.laa.2015.07.022
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:33 / 46
页数:14
相关论文
共 50 条