The inertia of distance matrices of some graphs

被引:16
|
作者
Zhang, Xiaoling [1 ]
Godsil, Chris [2 ]
机构
[1] Yantai Univ, Sch Math & Informat Sci, Yantai 264005, Shandong, Peoples R China
[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
关键词
Distance matrix; Inertia; Cactus; POLYNOMIALS; SPECTRUM;
D O I
10.1016/j.disc.2013.04.013
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let D denote the distance matrix of a connected graph G. The inertia of D is the triple of integers (n(+)(D), n(0)(D), n(-)(D)), where n(+)(D), n(0)(D), n(-)(D) denote the number of positive, 0, and negative eigenvalues of D, respectively. In this paper, we mainly give some graphs whose n(+)(D) is equal to 1 and get the inertia of their distance matrices. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:1655 / 1664
页数:10
相关论文
共 50 条