Open problems on graph eigenvalues studied with AutoGraphiX
type: Item
instance of: scholarly article
title: Open problems on graph eigenvalues studied with AutoGraphiX
zbMATH Open document ID: 1301.05211
author: Gilles Caporossi
author: Pierre Hansen
author: Mustapha Aouchiche
published in: EURO Journal on Computational Optimization
publication date: 2014-09-30T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6349864
zbMATH Keywords: graph eigenvalues
zbMATH Keywords: spectral radius
zbMATH Keywords: irregularity
zbMATH Keywords: spectral spread
zbMATH Keywords: Nordhaus-Gaddum
zbMATH Keywords: energy
describes a project that uses: AutoGraphiX
describes a project that uses: GRAPH
describes a project that uses: LEDA
describes a project that uses: GraphBase
describes a project that uses: Mathematica
MaRDI profile type: Publication
full work available at URL: s13675-012-0001-9
OpenAlex ID: W2001912026
cites work: Upper Bounds on the Order of a Clique of a Graph
cites work: Q4903450
cites work: Unicyclic graphs with large energy
cites work: Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
cites work: On a conjecture about the Randić index
cites work: Q3424766
cites work: On a conjecture about the Szeged index
cites work: Proximity and remoteness in graphs: Results and conjectures
cites work: A survey of Nordhaus-Gaddum type relations
cites work: Q4529449
cites work: Q5492533
cites work: Q5299398
cites work: Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
cites work: Q5454394
cites work: Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
cites work: Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
cites work: Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
cites work: Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
cites work: Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
cites work: A sharp upper bound on algebraic connectivity using domination number
cites work: On the extremal values of the second largest \(Q\)-eigenvalue
cites work: Q5717950
cites work: A note on the irregularity of graphs
cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
cites work: Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
cites work: Spektren endlicher Grafen
cites work: On a conjecture of V. Nikiforov
cites work: Q4327350
cites work: Q5477955
cites work: Variable neighborhood search for extremal graphs 3
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Q3154375
cites work: Q3374866
cites work: The spread of the spectrum of a graph
cites work: Q4186355
cites work: Q2724749
cites work: Q3069375
cites work: Q5477962
cites work: Q5477964
cites work: Variable neighborhood search: Principles and applications
cites work: Q4928216
cites work: A bound on the spectral radius of graphs
cites work: A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
cites work: A sharp upper bound of the spectral radius of graphs
cites work: Unicyclic graphs with maximal energy
cites work: Q3069374
cites work: Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
cites work: Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
cites work: Complete solution to a conjecture on the maximal energy of unicyclic graphs
cites work: Q3140399
cites work: On bicyclic graphs with maximal energy
cites work: Variable neighborhood search
cites work: Some Inequalities for the Largest Eigenvalue of a Graph
cites work: Eigenvalue problems of Nordhaus--Gaddum type

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: On Complementary Graphs

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: Q5644003

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: Q3216691

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: Q5477975

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: Bounds on the (Laplacian) spectral radius of graphs

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: Q4000231

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: A bound on the spectral radius of graphs with \(e\) edges

Open problems on graph eigenvalues studied with AutoGraphiX (cites work)
cites work: On the spectral radius of graphs with a given domination number

Open problems on graph eigenvalues studied with AutoGraphiX (DOI)
DOI: 10.1007/S13675-012-0001-9