Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees

Authors
Cvetkovic, D Simic, S Caporossi, G Hansen, P
Citation
D. Cvetkovic et al., Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees, LINEAR MULT, 49(2), 2001, pp. 143-160
Citations number
17
Categorie Soggetti
Mathematics
Journal title
LINEAR & MULTILINEAR ALGEBRA
ISSN journal
03081087 → ACNP
Volume
49
Issue
2
Year of publication
2001
Pages
143 - 160
Database
ISI
SICI code
0308-1087(2001)49:2<143:VNSFEG>2.0.ZU;2-F
Abstract
In the set of bicolored trees with given numbers of black and of white vert ices we describe those for which the largest eigenvalue is extremal (maxima l or minimal). The results are first obtained by the automated system AutoG raphiX, developed. in GERAD (Montreal), and verified afterwards by theoreti cal means.