The graphs with all but two eigenvalues equal to $$$$ or 0 |
| |
| Authors: | Sebastian M Cioabă Willem H Haemers Jason R Vermette |
| |
| Institution: | 1.Department of Mathematical Sciences,University of Delaware,Newark,USA;2.Department of Econometrics and Operations Research,Tilburg University,Tilburg,The Netherlands;3.Natural Sciences Division,Missouri Baptist University,Saint Louis,USA |
| |
| Abstract: | We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to \(-2\), or 0, and determine which of these graphs are determined by their adjacency spectrum. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
