Variable neighborhood search for extremal graphs 3
Dragoš Cvetković, Aleksandar Simić, Gilles Caporossi, Pierre Hansen · Linear and Multilinear Algebra · 2001
In the set of bicolored trees with given numbers of black and of white vertices we describe those for which the largest eigenvalue is extremal (maximal or minimal). The results are first obtained by the automated system AutoGraphiX, developed in GERAD (Montreal), and verified afterwards by theoretical means.