On the Index of Necklaces

On the Index of Necklaces

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2010-03, Vol.26 (2), p.163-172
Hauptverfasser: Belardo, Francesco, Li Marzi, Enzo M., Simić, Slobodan K., Wang, Jianfeng
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Eigenvalues
Engineering Design
Graphs
Mathematics
Mathematics and Statistics
Original Paper
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-010-0910-4