Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • Aouchiche, M.
  • Bell, F.K.
  • Cvetkovic, D.
  • Hansen, P.
  • Rowlinson, P.
  • Simic, S.K.
  • Stevanovic, D.
Registered author(s):

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6VCT-4N2KTC4-6/1/d6dc17fc7afb8092fafe562a67276a67
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 191 (2008)
    Issue (Month): 3 (December)
    Pages: 661-676

    as in new window
    Handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:661-676

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Michael D. König & Claudio J. Tessone & Yves Zenou, 2010. "From Assortative To Dissortative Networks: The Role Of Capacity Constraints," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 13(04), pages 483-499.
    2. Michael D. König & tefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The efficiency and evolution of R&D Networks," Documents de Travail de l'OFCE 2008-31, Observatoire Francais des Conjonctures Economiques (OFCE).
    3. Michael Koenig & Claudio Tessone & Yves Zenou, 2012. "Nestedness in Networks: A Theoretical Model and Some Applications," Discussion Papers 11-003, Stanford Institute for Economic Policy Research.
    4. König, Michael & Tessone, Claudio J. & Zenou, Yves, 2009. "A Dynamic Model of Network Formation with Strategic Interactions," CEPR Discussion Papers 7521, C.E.P.R. Discussion Papers.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:661-676

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.