Spectral determination of graphs whose components are paths and cycles

被引：14

作者：

Cvetkovic, Dragos ^{[2
]}

Simic, Slobodan K. ^{[2
]}

Stanic, Zoran ^{[1
]}

机构：

[1] Univ Belgrade, Fac Math, Belgrade 11000, Serbia

[2] Math Inst SANU, Belgrade 11000, Serbia

来源：

COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2010年 / 59卷 / 12期

关键词：

Paths; Cycles; Graph eigenvalues; Spectral determination;

D O I：

10.1016/j.camwa.2010.04.021

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We consider the class of graphs each of whose components is either a path or a cycle. We classify the graphs from the class considered into those which are determined and those which are not determined by the adjacency spectrum. In addition, we compare the result with the corresponding results for the Laplacian and the signless Laplacian spectra. It turns out that the signless Laplacian spectrum performs the best, confirming some expectations from the literature. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：3849 / 3857

页数：9

共 12 条

[1]

[Anonymous], U BEOGRAD PUBL ELE M

[2]

[Anonymous], LINEAR ALGEBRA APPL

[3]

Cvetkovic D., 1995, Spectra of Graphs: Theory and Applications

[4]

Cvetkovic D.M., 1975, Publ. Inst. Math. (Beograd) (N.S.), V18, P39