Variable Neighborhood Search for Extremal Graphs. 3. On the Largest Eigenvalue of Color-Constrained Trees

Cvetkovic, Dragos; Simic, S; Caporossi, Gilles; Hansen, Pierre

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.

Published December 1998 , 18 pages

This cahier was revised in April 2000

GERAD

G-98-66

Variable Neighborhood Search for Extremal Graphs. 3. On the Largest Eigenvalue of Color-Constrained Trees

Dragos Cvetkovic, S Simic, Gilles Caporossi, and Pierre Hansen