Новая страница: «'''Exceptional graph''' --- исключительный граф. A finite graph is said to be '''exceptional''' if it is connected, has at least eigenvalue <math…»
(Новая страница: «'''Exceptional graph''' --- исключительный граф. A finite graph is said to be '''exceptional''' if it is connected, has at least eigenvalue <math…»)