Please use this identifier to cite or link to this item:
|Title:||A recursive construction of the regular exceptional graphs with least eigenvalue -2|
Cardoso, Domingos M.
Simic, S. K.
|Keywords:||Spectral graph theory|
|Publisher:||European Mathematical Society Publishing House|
|Abstract:||In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has least eigenvalue greater than or equal to 2, and it is not a generalized line graph. A ðk; tÞ-regular set S of a graph is a vertex subset, inducing a k-regular subgraph such that every vertex not in S has t neighbors in S. We present a recursive construction of all regular exceptional graphs as successive extensions by regular sets.|
|Appears in Collections:||CIDMA - Artigos|
OGTCG - Artigos
Files in This Item:
|Barbedo_et_al.pdf||Research article||281.37 kB||Adobe PDF||Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.