Open problems on graph eigenvalues studied with AutoGraphiX
From MaRDI portal
Publication:743636
DOI10.1007/S13675-012-0001-9zbMATH Open1301.05211OpenAlexW2001912026MaRDI QIDQ743636FDOQ743636
Authors: Gilles Caporossi, Pierre Hansen, 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
Recommendations
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- A survey of automated conjectures in spectral graph theory
- Graph theoretical results obtained by the support of the expert system ``Graph -- an extended survey
- 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
Cites Work
- On a conjecture of V. Nikiforov
- A sharp upper bound of the spectral radius of graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a conjecture about the Szeged index
- Variable neighborhood search
- Title not available (Why is that?)
- Variable neighborhood search: Principles and applications
- Spektren endlicher Grafen
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Bounds on the (Laplacian) spectral radius of graphs
- Algorithms for drawing graphs: An annotated bibliography
- Title not available (Why is that?)
- A bound on the spectral radius of graphs
- A survey of Nordhaus-Gaddum type relations
- Title not available (Why is that?)
- On Complementary Graphs
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Proximity and remoteness in graphs: results and conjectures
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- Title not available (Why is that?)
- The spread of the spectrum of a graph
- A note on the irregularity of graphs
- Unicyclic graphs with maximal energy
- On the spectral radius of graphs with a given domination number
- Upper Bounds on the Order of a Clique of a Graph
- Eigenvalue problems of Nordhaus--Gaddum type
- A bound on the spectral radius of graphs with \(e\) edges
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- On a conjecture about the Randić index
- Title not available (Why is that?)
- On bicyclic graphs with maximal energy
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Title not available (Why is that?)
- Bipartite unicyclic graphs with maximal, second-maximal and third-maximal energy
- Unicyclic bipartite graphs with maximum energy
- On the extremal values of the second largest \(Q\)-eigenvalue
- Unicyclic graphs with large energy
- Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- Variable neighborhood search for extremal graphs. 18. Conjectures and results about Randić index
- Variable neighborhood search for extremal graphs 3
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs.
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- Graph theoretical results obtained by the support of the expert system ``Graph -- an extended survey
- How far is, should and could be conjecture-making in graph theory an automated process?
- Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- A sharp upper bound on algebraic connectivity using domination number
Cited In (7)
- 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
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Graph Limits and Spectral Extremal Problems for Graphs
- Graph theoretical results obtained by the support of the expert system ``Graph -- an extended survey
- Welfare targeting in networks
- A survey of automated conjectures in spectral graph theory
Uses Software
This page was built for publication: Open problems on graph eigenvalues studied with AutoGraphiX
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743636)
