|
|||||
|
|
Variable neighborhood search for extremal graphs 3 |
|
| Authors: | D. Cvetkovi&#x S. Simi&#x G. Caporossi P. Hansen |
| Affiliation: | D. Cvetković, ,S. Simić,,G. Caporossi,P. Hansen |
| Abstract: | 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. |
| Keywords: | Graph theory Automated discovery Eigenvalues Index AMS Subject Classifications: G5C 15 68T |
| 本文献已被 InformaWorld 等数据库收录！ | |