Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Variable neighborhood search for extremal graphs. 16 : Some conjectures related to the largest eigenvalue of a graph
    Aouchiche, Mustapha ...
    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 .nding 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.
    Vir: XVIIIth mini EURO conrefence on Variable neighborhood search : Tenerife, November 23-25, 2005 (Issue 3, Vol. 191, 2008, str. 661-676)
    Vrsta gradiva - prispevek na konferenci ; neleposlovje za odrasle
    Leto - 2008
    Jezik - angleški
    COBISS.SI-ID - 2014181
    DOI

Vnos na polico