{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:31:28Z","timestamp":1761888688775,"version":"build-2065373602"},"reference-count":81,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s13675-012-0001-9","type":"journal-article","created":{"date-parts":[[2012,11,19]],"date-time":"2012-11-19T09:02:19Z","timestamp":1353315739000},"page":"181-199","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Open problems on graph eigenvalues studied with AutoGraphiX"],"prefix":"10.1016","volume":"1","author":[{"given":"Mustapha","family":"Aouchiche","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Caporossi","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-012-0001-9_CR1","first-page":"215","article-title":"The irregularity of a graph","volume":"46","author":"Alberston","year":"1997","journal-title":"Ars Combin"},{"key":"10.1007\/s13675-012-0001-9_CR2","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1137\/0122052","article-title":"Upper bounds on the order of a clique of a graph","volume":"22","author":"Amin","year":"1972","journal-title":"SIAM J Appl Math"},{"key":"10.1007\/s13675-012-0001-9_CR3","first-page":"913","article-title":"Unicyclic bipartite graphs with maximum energy","volume":"66","author":"Andriantiana","year":"2011","journal-title":"MATCH Commun Math Comput Chem"},{"key":"10.1007\/s13675-012-0001-9_CR4","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1016\/j.laa.2011.03.013","article-title":"Unicyclic graphs with large energy","volume":"435","author":"Andriantiana","year":"2011","journal-title":"Linear Algebra Appl"},{"unstructured":"Aouchiche M (2006) Comparaison automatis\u00e9e d\u2019invariants en th\u00e9orie des graphes. PhD Thesis (French), \u00c9cole Polytechnique de Montr\u00e9al","key":"10.1007\/s13675-012-0001-9_CR5"},{"key":"10.1007\/s13675-012-0001-9_CR6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1051\/ro:2006006","article-title":"Recherche \u00e1 voisinage variable de graphes ext\u00e9maux. XIII. \u00c1 propos de la maille. (French) [Variable neighborhood search for extremal graphs. XIII. Girth]","volume":"39","author":"Aouchiche","year":"2005","journal-title":"RAIRO Oper Res"},{"key":"10.1007\/s13675-012-0001-9_CR7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.disc.2006.06.025","article-title":"On a conjecture about the Randi\u0107 index","volume":"307","author":"Aouchiche","year":"2007","journal-title":"Discrete Math"},{"doi-asserted-by":"crossref","unstructured":"Aouchiche M, Hansen P (2007b) Automated results and conjectures on average distance in graphs. In: Graph theory in Paris. Trends in mathematics. Birkh\u00e4user, Basel, pp 21\u201336","key":"10.1007\/s13675-012-0001-9_CR8","DOI":"10.1007\/978-3-7643-7400-6_3"},{"key":"10.1007\/s13675-012-0001-9_CR9","first-page":"21","article-title":"Bounding average distance using order and minimum degree","volume":"56","author":"Aouchiche","year":"2009","journal-title":"Graph Theory Notes N Y"},{"key":"10.1007\/s13675-012-0001-9_CR10","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1016\/j.ejc.2010.04.001","article-title":"On a conjecture about the Szeged index","volume":"31","author":"Aouchiche","year":"2010","journal-title":"Eur J Combin"},{"key":"10.1007\/s13675-012-0001-9_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.20450","article-title":"Proximity and remoteness in graphs: results and conjectures","volume":"58","author":"Aouchiche","year":"2011","journal-title":"Networks"},{"unstructured":"Aouchiche M, Hansen P (2012) A survey of Nordhaus-Gaddum type relations. Discrete Appl Math (in press) (available online 16 January 2012)","key":"10.1007\/s13675-012-0001-9_CR12"},{"key":"10.1007\/s13675-012-0001-9_CR13","first-page":"129","article-title":"Variable neighborhood search for extremal graphs 8. variations on graffiti 105","volume":"148","author":"Aouchiche","year":"2001","journal-title":"Congr Numer"},{"doi-asserted-by":"crossref","unstructured":"Aouchiche M, Bonnefoy J-M, Fidahoussen A, Caporossi G, Hansen P, Hiesse L, Lacher\u00e9 J, Monhait A (2005) Variable neighborhood search for extremal graphs. 14. The AutoGraphiX 2 System. In: Liberti L, Maculan N (eds) Global optimization: from theory to implementation. Springer, Berlin, pp 281\u2013310","key":"10.1007\/s13675-012-0001-9_CR14","DOI":"10.1007\/0-387-30528-9_10"},{"key":"10.1007\/s13675-012-0001-9_CR15","first-page":"541","article-title":"Variable neighborhood search for extremal graphs. XVIII. Conjectures and results about the Randi\u0107 index","volume":"56","author":"Aouchiche","year":"2006","journal-title":"MATCH Commun Math Comput Chem"},{"key":"10.1007\/s13675-012-0001-9_CR16","first-page":"365","article-title":"Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants","volume":"58","author":"Aouchiche","year":"2007","journal-title":"MATCH Commun Math Comput Chem"},{"key":"10.1007\/s13675-012-0001-9_CR17","first-page":"83","article-title":"Variable neighborhood search for extremal graphs. XIX. Further conjectures and results about the Randi\u0107 index","volume":"58","author":"Aouchiche","year":"2007","journal-title":"MATCH Commun Math Comput Chem"},{"key":"10.1007\/s13675-012-0001-9_CR18","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.ejor.2006.12.059","article-title":"Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph","volume":"191","author":"Aouchiche","year":"2008","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-012-0001-9_CR19","doi-asserted-by":"crossref","first-page":"2530","DOI":"10.1016\/j.dam.2008.03.011","article-title":"Variable neighborhood search for extremal graphs. XXI. Conjectures and results about the independence number","volume":"156","author":"Aouchiche","year":"2008","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-012-0001-9_CR20","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ro\/2009022","article-title":"Recherche \u00e1 voisinage variable de graphes extr\u00e9maux. XXVI. Nouveaux r\u00e9sultats sur la maille. (French) [Variable neighborhood search for extremal graphs. XXVI. New results for the girth]","volume":"43","author":"Aouchiche","year":"2009","journal-title":"RAIRO Oper Res"},{"key":"10.1007\/s13675-012-0001-9_CR21","doi-asserted-by":"crossref","first-page":"3497","DOI":"10.1016\/j.dam.2009.04.004","article-title":"Variable neighborhood search for extremal graphs. XXII. Extending bounds for independence to upper irredundance","volume":"157","author":"Aouchiche","year":"2009","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-012-0001-9_CR22","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7151\/dmgt.1430","article-title":"Variable Neighborhood Search for Extremal Graphs. XVII. Further conjectures and results about the index","volume":"29","author":"Aouchiche","year":"2009","journal-title":"Discuss Math Graph Theory"},{"key":"10.1007\/s13675-012-0001-9_CR23","doi-asserted-by":"crossref","first-page":"2879","DOI":"10.1016\/j.laa.2009.12.031","article-title":"A sharp upper bound on algebraic connectivity using domination number","volume":"432","author":"Aouchiche","year":"2010","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-012-0001-9_CR24","doi-asserted-by":"crossref","first-page":"2591","DOI":"10.1016\/j.laa.2011.03.051","article-title":"On the extremal values of the second largest Qeigenvalue","volume":"435","author":"Aouchiche","year":"2011","journal-title":"Linear Algebra Appl"},{"doi-asserted-by":"crossref","unstructured":"Belhaiza S, Abreu NMM, Hansen P, Oliveira CS (2005) Variable neighborhood search for extremal graphs 11. bounds on algebraic connectivity. In: Avis D, Hertz A, Marcotte O (eds) Graph theory and combinatorial optimization, GERAD 25th anniversary series, vol 8. Springer, New York, pp 1\u201316","key":"10.1007\/s13675-012-0001-9_CR25","DOI":"10.1007\/0-387-25592-3_1"},{"key":"10.1007\/s13675-012-0001-9_CR26","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0024-3795(92)90004-T","article-title":"A note on the irregularity of graphs","volume":"161","author":"Bell","year":"1992","journal-title":"Linear Algebra Appl"},{"unstructured":"Caporossi G (2000) D\u00e9couverte par Ordinateur en Th\u00e9orie de Graphes (French) PhD Thesis. \u00c9cole Polytechnique de Montr\u00e9al","key":"10.1007\/s13675-012-0001-9_CR27"},{"key":"10.1007\/s13675-012-0001-9_CR28","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1021\/ci9801419","article-title":"Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy","volume":"39","author":"Caporossi","year":"1999","journal-title":"J Chem Inf Comput Sci"},{"key":"10.1007\/s13675-012-0001-9_CR29","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0097-8485(99)00031-5","article-title":"Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index","volume":"23","author":"Caporossi","year":"1999","journal-title":"Comput Chem"},{"key":"10.1007\/s13675-012-0001-9_CR30","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0097-8485(02)00016-5","article-title":"Graphs with maximum connectivity index","volume":"27","author":"Caporossi","year":"2003","journal-title":"Computat Biol Chem"},{"key":"10.1007\/s13675-012-0001-9_CR31","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(99)00206-X","article-title":"Variable Neighborhood Search for Extremal Graphs: I. The AutoGraphiX System","volume":"212","author":"Caporossi","year":"2000","journal-title":"Discrete Math"},{"key":"10.1007\/s13675-012-0001-9_CR32","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(03)00311-X","article-title":"Variable neighborhood search for extremal graphs: V. Three ways to automate finding conjectures","volume":"276","author":"Caporossi","year":"2004","journal-title":"Discrete Math"},{"key":"10.1007\/s13675-012-0001-9_CR33","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF02941924","article-title":"Spektren endlicher Grafen","volume":"21","author":"Collatz","year":"1957","journal-title":"Abh Math Sem Univ Hamburg"},{"key":"10.1007\/s13675-012-0001-9_CR34","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1017\/S0305004100017175","article-title":"On the calculation of the energy in unsaturated hydrocarbon molecules","volume":"36","author":"Coulson","year":"1940","journal-title":"Proc Cambridge Phil Soc"},{"key":"10.1007\/s13675-012-0001-9_CR35","doi-asserted-by":"crossref","first-page":"4522","DOI":"10.1016\/j.disc.2009.02.013","article-title":"On a conjecture of V. Nikiforov","volume":"309","author":"Csikv\u00e1ri","year":"2009","journal-title":"Discrete Math"},{"year":"1995","author":"Cvetkovi\u0107","series-title":"Spectra of graphs\u2014theory and applications","key":"10.1007\/s13675-012-0001-9_CR36"},{"key":"10.1007\/s13675-012-0001-9_CR37","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1090\/dimacs\/069\/04","article-title":"Graph theoretical results obtained by the support of the expert system \u201cGRAPH\u201d\u2014an extended survey. In: Graphs and discovery","volume":"69","author":"Cvetkovi\u0107","year":"2005","journal-title":"DIMACS Ser Discrete Math Theoret Comput Sci"},{"key":"10.1007\/s13675-012-0001-9_CR38","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/03081080108818690","article-title":"Variable neighborhood search for extremalpagination graphs. III. On the largest eigenvalue of color-constrained trees","volume":"49","author":"Cvetkovi\u0107","year":"2001","journal-title":"Linear Multilinear Algebra"},{"issue":"5","key":"10.1007\/s13675-012-0001-9_CR39","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"di Battista","year":"1994","journal-title":"Comput Geom Theory Appl"},{"year":"1999","author":"di Battista","series-title":"Graph drawing: Algorithms for the visualization of graphs","key":"10.1007\/s13675-012-0001-9_CR40"},{"unstructured":"Fajtlowicz S, Fowler P, Hansen P, Janowitz M, Roberts f (eds) (2005) Graphs and discovery. DIMACS Ser Discrete Math Theor Comput Sci, vol 69. AMS, New York","key":"10.1007\/s13675-012-0001-9_CR41"},{"unstructured":"Finck H-J (1968) On the chromatic numbers of a graph and its complement, Theory of Graphs (Proc. Colloq., Tihany, 1966). Academic Press, New York, pp 99\u2013113","key":"10.1007\/s13675-012-0001-9_CR42"},{"key":"10.1007\/s13675-012-0001-9_CR43","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0009-2614(01)00570-X","article-title":"Variable neighborhood search for extremal graph 7. Polyenes with maximum homo-lumo gap","volume":"342","author":"Fowler","year":"2001","journal-title":"Chem Phys Lett"},{"key":"10.1007\/s13675-012-0001-9_CR44","doi-asserted-by":"crossref","first-page":"431","DOI":"10.2298\/JSC0804431F","article-title":"Bicyclic molecular graphs with the greatest energy","volume":"73","author":"Furtula","year":"2008","journal-title":"J Serb Chem Soc"},{"key":"10.1007\/s13675-012-0001-9_CR45","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0024-3795(00)00086-0","article-title":"The spread of the spectrum of a graph","volume":"332-334","author":"Gregory","year":"2001","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-012-0001-9_CR46","first-page":"1","article-title":"The energy of a graph","volume":"103","author":"Gutman","year":"1978","journal-title":"Ber Math Statist Sekt Forsch-ungsz Graz"},{"key":"10.1007\/s13675-012-0001-9_CR47","series-title":"Algebraic combinatorics and applications","first-page":"196","article-title":"The energy of a graph: Old and new results","author":"Gutman","year":"2001"},{"key":"10.1007\/s13675-012-0001-9_CR48","first-page":"75","article-title":"Bipartite unicyclic graphs with maximal, second-maximal, and third-maximal energy","volume":"58","author":"Gutman","year":"2007","journal-title":"Match"},{"key":"10.1007\/s13675-012-0001-9_CR49","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1021\/ci0342775","article-title":"Variable neighborhood search for extremal graphs. 10. Comparison of irregularity indices for chemical trees","volume":"45","author":"Gutman","year":"2005","journal-title":"J Chem Inf Model"},{"key":"10.1007\/s13675-012-0001-9_CR50","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/S0009-2614(99)00472-8","article-title":"Alkanes with small and large randi\u0107 connectivity indices","volume":"306","author":"Gutman","year":"1999","journal-title":"Chem Phys Lett"},{"key":"10.1007\/s13675-012-0001-9_CR51","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1021\/ci000164z","article-title":"Quest for molecular graphs with maximal energy: a computer experiment","volume":"41","author":"Gutman","year":"2001","journal-title":"J Chem Inf Sci"},{"unstructured":"Hansen P (2005) How far is, should and could be conjecture-making in graph theory an automated process? In: Fajtlowicz S, Fowler P, Hansen P, Janowitz M, Roberts f (eds) Graphs and discovery. DIMACS Ser Discrete Math Theor Comput Sci, vol 69. AMS, New York, pp 189\u2013229","key":"10.1007\/s13675-012-0001-9_CR52"},{"key":"10.1007\/s13675-012-0001-9_CR53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1021\/ci010133j","article-title":"Variable neighborhood search for extremal graphs 6. Analyzing bounds for the connectivity index","volume":"43","author":"Hansen","year":"2003","journal-title":"J Chem Inf Comp Sci"},{"unstructured":"Hansen P, M\u00e9lot H (2005) Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph. In: Fajtlowicz S, Fowler P, Hansen P, Janowitz M, Roberts f (eds) Graphs and discovery. DIMACS Ser Discrete Math Theor Comput Sci, vol 69. AMS, New York","key":"10.1007\/s13675-012-0001-9_CR54"},{"key":"10.1007\/s13675-012-0001-9_CR55","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-012-0001-9_CR56","first-page":"221","article-title":"Variable neighborhood search for extremal graphs 12. A note on the variance of bounded degrees in graphs","volume":"54","author":"Hansen","year":"2005","journal-title":"MATCH Commun Math Comput Chem"},{"key":"10.1007\/s13675-012-0001-9_CR57","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0024-3795(88)90183-8","article-title":"A bound on the spectral radius of graphs","volume":"108","author":"Hong","year":"1988","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-012-0001-9_CR58","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(99)90280-7","article-title":"A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type","volume":"211","author":"Hong","year":"2000","journal-title":"Discrete Math"},{"issue":"2","key":"10.1007\/s13675-012-0001-9_CR59","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jctb.2000.1997","article-title":"A sharp upper bound of the spectral radius of graphs","volume":"81","author":"Hong","year":"2001","journal-title":"J Combin Theory Ser B"},{"key":"10.1007\/s13675-012-0001-9_CR60","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0024-3795(01)00609-7","article-title":"Unicyclic graphs with maximal energy","volume":"356","author":"Hou","year":"2002","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-012-0001-9_CR61","first-page":"57","article-title":"Bipartite unicyclic graphs with large energy","volume":"58","author":"Hua","year":"2007","journal-title":"MATCH Commun Math Comput Chem"},{"key":"10.1007\/s13675-012-0001-9_CR62","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1016\/j.laa.2011.02.001","article-title":"Solution to a conjecture on the maximal energy of bipartite bicyclic graphs","volume":"435","author":"Huo","year":"2011","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-012-0001-9_CR63","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1016\/j.laa.2010.11.025","article-title":"Complete solution to a problem on the maximal energy of unicyclic bipartite graphs","volume":"434","author":"Huo","year":"2011","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-012-0001-9_CR64","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.ejc.2011.02.011","article-title":"Complete solution to a conjecture on the maximal energy of unicyclic graphs","volume":"32","author":"Huo","year":"2011","journal-title":"Eur J Combin"},{"unstructured":"Knuth D (1993) The Stanford graphbase: a platform for combinatorial computing. Addison-Wesley, Reading","key":"10.1007\/s13675-012-0001-9_CR65"},{"key":"10.1007\/s13675-012-0001-9_CR66","first-page":"297","article-title":"The relations between the spectral radius of the graphs and their complement (Chinese)","volume":"17","author":"Li","year":"1996","journal-title":"J North China Technol Inst"},{"key":"10.1007\/s13675-012-0001-9_CR67","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.laa.2007.06.022","article-title":"On bicyclic graphs with maximal energy","volume":"427","author":"Li","year":"2007","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"10.1007\/s13675-012-0001-9_CR68","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/204865.204889","article-title":"Leda: a platform for combinatorial and geometric computing","volume":"38","author":"Mehlhorn","year":"1995","journal-title":"Commun ACM"},{"key":"10.1007\/s13675-012-0001-9_CR69","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-012-0001-9_CR70","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1017\/S0963548301004928","article-title":"Some inequalities for the largest eigenvalue of a graph","volume":"11","author":"Nikiforov","year":"2002","journal-title":"Combin Probab Comput"},{"key":"10.1007\/s13675-012-0001-9_CR71","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.disc.2006.07.035","article-title":"Eigenvalue problems of Nordhaus-Gaddum type","volume":"307","author":"Nikiforov","year":"2007","journal-title":"Discrete Math"},{"key":"10.1007\/s13675-012-0001-9_CR72","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Am Math Monthly"},{"unstructured":"Nosal E (1970) Eigenvalues of graphs. University of Calgary, Master Thesis","key":"10.1007\/s13675-012-0001-9_CR73"},{"issue":"48","key":"10.1007\/s13675-012-0001-9_CR74","first-page":"169","article-title":"On graphs whose spectral spread does not exceed 4","volume":"34","author":"Petrovi\u0107","year":"1983","journal-title":"Publ Inst Math (Beograd)"},{"unstructured":"Pisanski T, Zitnik A (2002) Interactive conjecturing with vega. In: Fajtlowicz S, Fowler P, Hansen P, Janowitz M, Roberts f (eds) Graphs and discovery. DIMACS Ser Discrete Math Theor Comput Sci, vol 69. AMS, New York","key":"10.1007\/s13675-012-0001-9_CR75"},{"key":"10.1007\/s13675-012-0001-9_CR76","first-page":"6","article-title":"Variable neighborhood search for extremal graphs. XXV. Products of connectivity and distance measures","volume":"55","author":"Sedlar","year":"2008","journal-title":"Graph Theory Notes New York"},{"key":"10.1007\/s13675-012-0001-9_CR77","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.laa.2006.12.003","article-title":"Bounds on the (Laplacian) spectral radius of graphs","volume":"422","author":"Shi","year":"2007","journal-title":"Linear Algebra Appl"},{"unstructured":"Shu J-L, Wu Y (2003) The spread of the unicyclic graphs. electronic file available at http:\/\/www.math.ecnu.edu.cn\/preprint\/2003-004.pdf","key":"10.1007\/s13675-012-0001-9_CR78"},{"year":"1990","author":"Skiena","series-title":"Implementing discrete mathematics: combinatorics and graph theory with mathematica","key":"10.1007\/s13675-012-0001-9_CR79"},{"key":"10.1007\/s13675-012-0001-9_CR80","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0024-3795(87)90172-8","article-title":"A bound on the spectral radius of graphs with e edges","volume":"87","author":"Stanley","year":"1987","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-012-0001-9_CR81","doi-asserted-by":"crossref","first-page":"1854","DOI":"10.1016\/j.laa.2007.10.024","article-title":"On the spectral radius of graphs with a given domination number","volume":"428","author":"Stevanovi\u0107","year":"2008","journal-title":"Linear Algebra Appl"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0001-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-012-0001-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0001-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:32Z","timestamp":1761882332000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":81,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S2192440621000174"],"URL":"https:\/\/doi.org\/10.1007\/s13675-012-0001-9","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Open problems on graph eigenvalues studied with AutoGraphiX","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-012-0001-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}