Open problems on graph eigenvalues studied with AutoGraphiX
From MaRDI portal
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
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 5841259 (Why is no real title available?)
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3882475 (Why is no real title available?)
- scientific article; zbMATH DE number 5009139 (Why is no real title available?)
- scientific article; zbMATH DE number 5130720 (Why is no real title available?)
- scientific article; zbMATH DE number 50596 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1743972 (Why is no real title available?)
- scientific article; zbMATH DE number 5255694 (Why is no real title available?)
- scientific article; zbMATH DE number 5037223 (Why is no real title available?)
- scientific article; zbMATH DE number 3372065 (Why is no real title available?)
- scientific article; zbMATH DE number 2246587 (Why is no real title available?)
- A bound on the spectral radius of graphs
- A bound on the spectral radius of graphs with \(e\) edges
- A note on the irregularity of graphs
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- A sharp upper bound of the spectral radius of graphs
- A sharp upper bound on algebraic connectivity using domination number
- A survey of Nordhaus-Gaddum type relations
- Algorithms for drawing graphs: An annotated bibliography
- Bipartite unicyclic graphs with maximal, second-maximal and third-maximal energy
- Bounds on the (Laplacian) spectral radius of graphs
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Eigenvalue problems of Nordhaus--Gaddum type
- 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?
- On Complementary Graphs
- On a conjecture about the Randić index
- On a conjecture about the Szeged index
- On a conjecture of V. Nikiforov
- On bicyclic graphs with maximal energy
- On the extremal values of the second largest \(Q\)-eigenvalue
- On the spectral radius of graphs with a given domination number
- Proximity and remoteness in graphs: results and conjectures
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spektren endlicher Grafen
- The spread of the spectrum of a graph
- Unicyclic bipartite graphs with maximum energy
- Unicyclic graphs with large energy
- Unicyclic graphs with maximal energy
- Upper Bounds on the Order of a Clique of a Graph
- Variable neighborhood search
- Variable neighborhood search for extremal graphs 3
- Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs.
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Variable neighborhood search for extremal graphs. 18. Conjectures and results about Randić index
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- 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
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- Variable neighborhood search: Principles and applications
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
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)
