ON SPECTRAL RADIUS OF THE DISTANCE MATRIX

被引：28

作者：

Liu, Zhongzhu ^{[1
]}

机构：

[1] S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China

来源：

APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS | 2010年 / 4卷 / 02期

关键词：

Distance matrix; spectral radius; vertex connectivity; matching number; chromatic number; LARGEST EIGENVALUE; GRAPH;

D O I：

10.2298/AADM100428020L

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

we characterize graphs with minimal spectral radius of the distance matrix in three classes of simple connected graphs with n vertices: with fixed vertex connectivity, matching number and chromatic number, respectively.

引用

页码：269 / 277

页数：9

共 9 条

[1]

[Anonymous], 1990, Distance in Graphs

[2]

BERGE C, 1958, CR HEBD ACAD SCI, V247, P258

[3]

Das KC, 2009, MATCH-COMMUN MATH CO, V62, P667

[4]

Gutman I, 1998, INDIAN J CHEM A, V37, P569

[5]

Indulal G, 2008, MATH COMMUN, V13, P123

[6]

Tutte William T., 1947, J. London Math. Soc., V1, P107, DOI DOI 10.1112/JLMS/S1-22.2.107

[7]

Zhou B., 2007, INTERNET ELECT J MOL, V6, P375

[8] On the largest eigenvalue of the distance matrix of a connected graph [J].

Zhou, Bo ;

Trinajstic, Nenad .

CHEMICAL PHYSICS LETTERS, 2007, 447 (4-6) :384-387

[9]

Zhou B, 2007, MATCH-COMMUN MATH CO, V58, P657

← 1 →