|
|||||
|
|
On the Index of Necklaces |
|
| Authors: | Francesco Belardo Enzo M. Li Marzi Slobodan K. Simić Jianfeng Wang |
| Affiliation: | 1. Department of Mathematics, University of Messina, Messina, Italy 2. Mathematical Institute SANU, Belgrade, Serbia 3. Department of Mathematics and Information Science, Qinghai Normal University, Xining, Qinghai, People’s Republic of China |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |