Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- 16 December 2008
- journal article
- research article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 191 (3), 661-676
- https://doi.org/10.1016/j.ejor.2006.12.059
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la mailleRairo-Operations Research, 2005
- Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical TreesJournal of Chemical Information and Modeling, 2005
- On some interconnections between combinatorial optimization and extremal graph theoryYugoslav Journal of Operations Research, 2004
- Variable Neighborhood Search for Extremal Graphs. 6. Analyzing Bounds for the Connectivity IndexJournal of Chemical Information and Computer Sciences, 2002
- Variable neighborhood search for extremal graphs 3Linear and Multilinear Algebra, 2001
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal EnergyJournal of Chemical Information and Computer Sciences, 1999
- The largest eigenvalue of a graph: A surveyLinear and Multilinear Algebra, 1990
- On the eigenvalues of treesPeriodica Mathematica Hungarica, 1973
- On Complementary GraphsThe American Mathematical Monthly, 1956