Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
From MaRDI portal
Publication:932184
DOI10.1016/j.ejor.2006.12.059zbMath1160.90494OpenAlexW1996653774WikidataQ123097886 ScholiaQ123097886MaRDI QIDQ932184
Pierre Hansen, Dragan Stevanović, Francis K. Bell, Dragos Cvetković, Slobodan K. Simic, Peter Rowlinson, Mustapha Aouchiche
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.059
graphirregularityadjacency matrixindexlargest eigenvaluevariable neighborhood searchconjecturesextremal graphautographixspectral spread
Related Items
Three conjectures in extremal spectral graph theory, Generalizations of some Nordhaus–Gaddum‐type results on spectral radius, Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case, Maximum spread of \(K_{2,t}\)-minor-free graphs, The efficiency and stability of R\&D networks, (n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex Functions, Graph Limits and Spectral Extremal Problems for Graphs, Graphs for which the least eigenvalue is minimal. I, Graphs for which the least eigenvalue is minimal. II., On the irregularity of uniform hypergraphs, A survey of automated conjectures in spectral graph theory, Connected graphs of fixed order and size with maximal index: some spectral bounds, Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index, More on ``Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index, Characterizing graphs of maximum principal ratio, Variable neighbourhood search: methods and applications, On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index, Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case, Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph, Graphs with maximal signless Laplacian spectral radius, On the reduced signless Laplacian spectrum of a degree maximal graph, Some notes on the threshold graphs, On the spectral radius of quasi-\(k\)-cyclic graphs, Vertex deletion on split graphs: beyond 4-hitting set, Open problems on graph eigenvalues studied with AutoGraphiX, Variable neighbourhood search: Methods and applications, The graphs cospectral with the pineapple graph, Some bounds on the Aα-index of connected graphs with fixed order and size
Uses Software
Cites Work
- Spektren endlicher Grafen
- The spread of the unicyclic graphs
- A bound on the spectral radius of graphs
- On the maximal index of connected graphs
- A note on the irregularity of graphs
- Variable neighborhood search
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- The critical group of a threshold graph
- A bound on the spectral radius of graphs with \(e\) edges
- A sharp upper bound of the spectral radius of graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- On the eigenvalues of trees
- Variable neighborhood search for extremal graphs 3
- Some Inequalities for the Largest Eigenvalue of a Graph
- On Complementary Graphs
- The maximal spectral radius of a digraph with (m+1)^2-s edges
- The largest eigenvalue of a graph: A survey
- On some interconnections between combinatorial optimization and extremal graph theory
- 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
