On the Index of Necklaces

被引：2

作者：

Belardo, Francesco ^{[1
]}

Li Marzi, Enzo M. ^{[1
]}

Simic, Slobodan K. ^{[2
]}

Wang, Jianfeng ^{[3
]}

机构：

[1] Univ Messina, Dept Math, I-98100 Messina, Italy

[2] Math Inst SANU, Belgrade, Serbia

[3] Qinghai Normal Univ, Dept Math & Informat Sci, Xining, Qinghai, Peoples R China

来源：

GRAPHS AND COMBINATORICS | 2010年 / 26卷 / 02期

基金：

美国国家科学基金会;

关键词：

Adjacency spectrum; Signless Laplacian spectrum; Caterpillars; Unicyclic graphs; Line graphs; Largest eigenvalue;

D O I：

10.1007/s00373-010-0910-4

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We consider the following two classes of simple graphs: open necklaces and closed necklaces, consisting of a finite number of cliques of fixed orders arranged in path-like pattern and cycle-like pattern, respectively. In these two classes we determine those graphs whose index (the largest eigenvalue of the adjacency matrix) is maximal.

引用

页码：163 / 172

页数：10

共 14 条

[1]

[Anonymous], 1997, Eigenspaces of graphs

[2] Some results on the index of unicyclic graphs [J].