Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph

Citation

Aouchiche M, Bell FK, Cvetkovic D, Hansen P, Rowlinson P, Simic SK & Stevanovic D (2008) Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph. European Journal of Operational Research, 191 (3), pp. 661-676. https://doi.org/10.1016/j.ejor.2006.12.059

Abstract
We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have been formulated after some experiments with the programming system AutoGraphiX, designed for finding extremal graphs with respect to given properties by the use of variable neighborhood search. The conjectures are related to the maximal value of the irregularity and spectral spread in n-vertex graphs, to a Nordhaus–Gaddum type upper bound for the index, and to the maximal value of the index for graphs with given numbers of vertices and edges. None of the conjectures has been resolved so far. We present partial results and provide some indications that the conjectures are very hard.

Keywords
3; ABSTRACTS; ACCURACY; Canada; codes; COMPUTER programming; Copyright; EIGENVALUES; email; ENGINEERING; experiment; graph; GRAPHIC methods; MATHEMATICS; MATRICES; method; methods; NUMBER; OPERATIONS research; properties; Research; respect; Science; Sciences; Scotland; SEARCH; Serbia; service; services; Simulation; SIMULATION methods; SITES; STATISTICS; Stirling; SYSTEM; UK; universities; VALUE

Journal
European Journal of Operational Research: Volume 191, Issue 3