Variable neighborhood search for extremal graphs-Reference-Cited by-同舟云学术

Variable neighborhood search for extremal graphs

Published:1999-09 Issue:5 Volume:23 Page:469-477
ISSN:0097-8485
Container-title:Computers & Chemistry
language:en
Short-container-title:Computers & Chemistry

Author:

Caporossi Gilles,Gutman Ivan,Hansen Pierre

Publisher

Elsevier BV

Subject

General Chemical Engineering,Applied Microbiology and Biotechnology,Biotechnology

Reference27 articles.

1. An alternative approach to orthogonal graph theoretical invariants

2. Caporossi, G., Cvetković, D., Gutman, I., Hansen, P. 1999. Variable neighborhood search for chemical graphs. II: finding graphs with extremal energy. Journal of Chemical Information and Computer Sciences 39

3. Caporossi, G., Hansen, P., 1997. Variable neighborhood search for extremal graphs. I: The AutoGraphiX system, Les Cahiers du GERAD G-97-41; Discrete Mathematics, to appear

4. Linear Programming;Chvátal,1983

Cited by 63 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The minimal chemical tree for the difference between geometric–arithmetic and Randić indices;International Journal of Quantum Chemistry;2024-01-05

2. Extremal Values of the Randić Index of Trees;Advances in Intelligent Systems and Computing;2023

3. Extremal trees for the Randić index;Acta Universitatis Sapientiae, Mathematica;2022-12-01

4. On the extremal geometric–arithmetic graphs with fixed number of vertices having minimum degree;Annals of Operations Research;2022-06-15

5. On the second maximum Wiener polarity index of chemical trees of a fixed order;International Journal of Quantum Chemistry;2021-02-18