Open problems on graph eigenvalues studied with AutoGraphiX
From MaRDI portal
Publication:743636
DOI10.1007/s13675-012-0001-9zbMath1301.05211OpenAlexW2001912026MaRDI QIDQ743636
Pierre Hansen, Gilles Caporossi, Mustapha Aouchiche
Publication date: 30 September 2014
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-012-0001-9
Related Items
Graph Limits and Spectral Extremal Problems for Graphs, Welfare targeting in networks, On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index, Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
Uses Software
Cites Work
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- On the extremal values of the second largest \(Q\)-eigenvalue
- Unicyclic graphs with large energy
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- On a conjecture about the Szeged index
- Spektren endlicher Grafen
- On a conjecture about the Randić index
- Eigenvalue problems of Nordhaus--Gaddum type
- Bounds on the (Laplacian) spectral radius of graphs
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- A sharp upper bound on algebraic connectivity using domination number
- On a conjecture of V. Nikiforov
- A bound on the spectral radius of graphs
- A note on the irregularity of graphs
- Algorithms for drawing graphs: An annotated bibliography
- Variable neighborhood search
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- A bound on the spectral radius of graphs with \(e\) edges
- A sharp upper bound of the spectral radius of graphs
- Unicyclic graphs with maximal energy
- A survey of Nordhaus-Gaddum type relations
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- On bicyclic graphs with maximal energy
- On the spectral radius of graphs with a given domination number
- Variable neighborhood search for extremal graphs 3
- Proximity and remoteness in graphs: Results and conjectures
- Some Inequalities for the Largest Eigenvalue of a Graph
- On Complementary Graphs
- Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- Upper Bounds on the Order of a Clique of a Graph
- Variable neighborhood search: Principles and applications
- The spread of the spectrum of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
