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

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2015年 / 485卷

基金：

中国国家自然科学基金;

关键词：

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

共 8 条

[1] On distance matrices and Laplacians [J].

Bapat, R ;

Kirkland, SJ ;

Neumann, M .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 401 :193-209

[2] A q-analogue of the distance matrix of a tree [J].

Bapat, R. B. ;

Lal, A. K. ;

Pati, Sukanta .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 416 (2-3) :799-814

[3] Product distance matrix of a tree with matrix weights [J].

Bapat, R. B. ;

Sivasubramanian, Sivaramakrishnan .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 468 :145-153

[4] Inverse of the distance matrix of a block graph [J].

Bapat, R. B. ;

Sivasubramanian, Sivaramakrishnan .

LINEAR & MULTILINEAR ALGEBRA, 2011, 59 (12) :1393-1397

[5]

Graham R.L., 1977, J. Graph Theory, V1, P85

[6] DISTANCE MATRIX POLYNOMIALS OF TREES [J].

GRAHAM, RL ;

LOVASZ, L .

ADVANCES IN MATHEMATICS, 1978, 29 (01) :60-88

[7] Inverse of the distance matrix of a cactoid digraph [J].

Hou, Yaoping ;

Chen, Jing .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 475 :1-10

[8] q-Analogs of distance matrices of 3-hypertrees [J].

Sivasubramanian, Sivaramakrishnan .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 431 (08) :1234-1248

← 1 →