TY: JOUR
T1 - A recursive construction of the regular exceptional graphs with least eigenvalue -2
A1 - Barbedo, I.
A1 - Cardoso, Domingos M.
A1 - Cvetkovic, D.
A1 - Rama, P.
A1 - Simic, S. K.
N2 - 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.
UR - https://ria.ua.pt/handle/10773/13473
Y1 - 2014
PB - European Mathematical Society Publishing House