Exceptional graph

Exceptional graph --- исключительный граф.

A finite graph is said to be exceptional if it is connected, has at least eigenvalue [math]\displaystyle{ \lambda_{min} \geq -2 }[/math] and is not a generalized line graph.