The graphs with all but two eigenvalues equal to $2$ or $-1$
| Autor: | Li, Jing, Li, Deqiong, Hou, Yaoping |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | In this paper, all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $2$ and $-1$ are determined. These graphs conclude a class of generalized friendship graphs $F_{t,r,k}, $ which is the graph of $k$ copies of the complete graph $K_t$ meeting in common $r$ vertices such that $t-r=3.$ Which of these graphs are determined by its spectrum is are also obtained. Comment: 18 pages, 2 figures. arXiv admin note: text overlap with arXiv:1310.6529 by other authors |
| Databáze: | arXiv |
| Externí odkaz: |
|