Variable neighborhood search for extremal graphs 3
From MaRDI portal
Publication:2756161
DOI10.1080/03081080108818690zbMath1003.05058OpenAlexW1598613520MaRDI QIDQ2756161
Gilles Caporossi, Pierre Hansen, Slobodan K. Simic, Dragos Cvetković
Publication date: 27 January 2002
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080108818690
Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Related Items
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships, Corrections of proofs for Hansen and Mélot's two theorems, Facet defining inequalities among graph invariants: The system graphedron, On the index of caterpillars, A survey of automated conjectures in spectral graph theory, On bags and bugs, Variable neighbourhood search: methods and applications, Some results on the index of unicyclic graphs, Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille, Open problems on graph eigenvalues studied with AutoGraphiX, Variable neighbourhood search: Methods and applications, Non-bipartite graphs of fixed order and size that minimize the least eigenvalue, Computers and discovery in algebraic graph theory, AutoGraphiX: a survey
Uses Software
Cites Work
