Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index

Journal of Chemical Information and Computer Sciences

Volumn 43, Issue 1, 2003, Pages 1-14

  Hansen, Pierre ^a   Mélot, Hadrien ^b  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DATABASE SYSTEMS; HAMILTONIANS; INVARIANCE;

CHEMICAL GRAPHS; CHEMICAL TREES; CONNENCTIVITY INDEX;

GRAPH THEORY;

EID: 0037262955     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci010133j     Document Type: Article

References (55)

1. Araujo, O.; De la Peña, J. A. Some Bounds for the Connectivity Index of a Chemical Graph. J. Chem. Inf. Comput. Sci. 1998, 38, 827-831.
2. Structure-Based Drug Design: Experimental and Computational Approaches; Codding, P. W., Ed.; Kluwer: Dordrecht, 1998.
3. Devillers, J. Neural Networks in QSAR and Drug Design; Academic Press: London, 1996.
4. Topological Indices and Related Descriptors in QSAR and QSPR; Devillers, J., Baladan, A., Eds; Gordon and Breach: Newark, 2000.
5. Doucet, J.-P.; Weber, J. Computer-Aided Molecular Design; Academic Press: London, 1996.
6. Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches; Floudas, C. A., Pardalos, P. M., Eds.; Kluwer: Dordrecht, 2000.
7. Hansch, C.; Leo, A.; Hoekman, D. Exploring QSAR, Vols. I and II; ACS Professional Reference Book, Oxford University Press: New York, 1995.
8. Karelson, M. Molecular Descriptors in QSAR/QSPR; Wiley: New York, 2000.
9. Kier, L. B.; Hall, L. H. Molecular Connectivity in Chemistry and Drug Research; Academic Press: New York, 1976.
10. Kier, L. B.; Hall, L. H. Molecular Connectivity in Structure-Activity Analysis; Wiley: New York, 1986.
11. Kier, L. B.; Hall, L. H. Molecular Structure Description; Academic Press: London, 1999.
12. Lutz, M.; Kenadin, T. Quantitative Molecular Pharmacology and Informatics in Drug Discovery; Wiley: New York, 1999.
13. Todeschini, R., Consonni, V. Handbook of Molecular Descriptors; Wiley: New York, 2001.
14. Structure-Property Correlations in Drug Research; van de Waterbeemd, H., Ed.; Academic Press: London, 1996.
15. Computer-Assisted Lead Finding and Optimization. van de Waterbeemd, H., Testa, B., Folkers, G., Eds.; Proceedings of the 11th European Symposium on QSAR, VCH: Weinheim, 1996.
16. Cvetković, D.; Kraus, L. L.; Simic, S. K. Discussing Graph Theory with a Computer, I: Implementation of Graph Theoretic Algorithms. Univ. Beograd Publ. Emektrotehn. Fak. 1981, 100-104.
17. Cvetković, D.; Kraus, L. "Graph" an Expert System for the Classification and Extension of the Knowledge in the Field of Graph Theory, User's Manual. Elektrotehn. Fak., Beograd. 1983.
18. Cvetković, D.; Simic, S. Graph Theoretical Results Obtained by the Support of the Expert System "Graph". Bull. l'Acad. Serbe Sci. Arts (T. CVII): 1994, 19-41.
19. Knuth, D. The Stanford Graphbase: A platform for Combinatorial Computing; Addison - Wesley: Reading, MA, 1993.
20. Berry, J. W. Improving Discrete Mathematics and Algorithms Curricula with LINK. SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education) 1997, 29, 14-20.
21. Berry, J. W. LINK: A Software System for Experimentation with Graphs and Hypergraphs. SIAM Discrete Math. Newsletter 1997, 2.
22. Berry, J. W.; Dean, N.; Goldberg, M. K.; Shannon, G. E.; Skiena, S. Graph Drawing and Manipulation with LINK. Lecture Notes Comput. Sci. 1997, 1353, 425-437.
23. Berry, J. W.; Dean, N.; Goldberg, M. K.; Shannon, G. E.; Skiena, S. LINK: A System for Graph Computation. Software - Practice and Experience 1999.
24. Vega. A System for Manipulating Discrete Mathematical Structures. Project Homepage: http://vega.ijp.si/.
25. Dutton, R. D.; Brigham, R. C. Ingrid: A Software Tool for Extremal Graph Theory Research. Congressum Numerantium 1983, 39, 337-352.
26. Brigham, R. C.; Dutton, R. D. A Compilation of Relations Between Graph Invariants. Networks 1985, 15, 73-107.
27. Brigham, R. C.; Dutton, R. D.; Gomez, F. INGRID: A Graph Invariant Manipulator. J. Symbolic Comput. 1989, 7, 163-177.
28. Brigham, R. C.; Dutton, R. D. A Compilation of Relations Between Graph Invariants, Supplement I. Networks 1991, 21, 421-455.
29. Fajtlowicz, S. On Conjectures of Graffiti. Discrete Mathematics 1988, 72, 113-118.
30. Fajtlowicz, S. On Conjectures of Graffiti - II. Congr. Numer. 1987, 60, 187-197.
31. Fajtlowicz, S. On Conjectures of Graffiti - III. Congr. Numer. 1988, 66, 23-32.
32. Fajtlowicz, S. On Conjectures of Graffiti - IV. Congr. Numer. 1990, 70, 231-240.
33. Fajtlowicz, S. On Conjectures of Graffiti - V. In Seventh International Quadrennial Conference on Graph Theory; 1995; Vol. 1, pp. 367-376.
34. Fajtlowicz, S. Written on the Wall. A regularly updated file accessible from http://www.math.uh.edu/~clarson/.
35. De la Vina, E. Bibliography on Conjectures of Graffiti http://cms.dt.uh.edu/faculty/delavinae/research/wowref.htm, 2000.
36. Caporossi, G.; Hansen, P. Variable Neighborhood for Extremal Graphs 1. The System AutoGraphiX. Discr. Math. 2000, 212, 29-44.
37. Hansen, P.; Mladenovic, N. Variable Neighborhood Search: Principles and Applications. Eur. J. Oper. Res. 2001, 130, 449-467.
38. Caporossi, G.; Hansen, P. Variable Neighborhood for Extremal Graphs 5. Three Ways to Automate Finding Conjectures. LEs Cahiers du GERAD, G-2000-58. To appear in Discrete Mathematics.
39. Caporossi, G.; Dobrynin, A. A.; Hansen, P.; Gutman, I. Trees with Palindromic Hosoya Polynomials. Graph Theory Notes N. Y. 1999, 37, 10-16.
40. Caporossi, G.; Cvetković, D.; Hansen, P.; Simic, S. Variable Neighborhood Search for Extremal Graphs 3. On the Largest Eigenvalue of Color-Constrained Trees. Lin. Multilin. Algebra 2001, 49, 143-160.
41. Aouchiche, M.; Caporossi, G.; Hansen, P. Variable Neighborhood Search for Extremal Graphs 8. Variations on Graffiti 105. Congressus Numerantium 2001, 148, 129-144.
42. Caporossi, G.; Cvetković, D.; Gutman, I.; Hansen, P. Variable Neighborhood Search for Extremal Graphs 2. Finding Graphs with Extremal Energy. J. Chem. Inf. Comput. Sci. 1999, 39, 984-996.
43. Gutman, I.; Hou, Y. Bipartite Unicyclic Graphs with Greatest Energy. Comm. Math. Comput. Chem. 2001, 43, 17-28.
44. Caporossi, G.; Gutman, I.; Hansen, P. Variable Neighborhood Search for Extremal Graphs 4. Chemical Trees with Extremal Connectivity Index. Comput. Chem. 1999, 23, 469-477.
45. Caporossi, G.; Gutnam, I.; Hansen, P.; Pavlovic, L. Graphs with Maximum Connectivity Index. Les Cahiers du GERAD. G-2001-50. 2001. Computers and Chemistry (in press).
46. Gutnam, I.; Miljković, O.; Caporossi, G.; Hansen, P. Alkanes with Small and Large Randic Connectivity Index. Chem. Phys. Lett. 1999, 306, 366-372.
47. Gutnam, I.; Araujo, O.; Morales, D. A. Bounds for the Randic Connectivity Index. J. Chem. Inf. Comput. Sci. 2000, 40, 572-598.
48. Gutnam, I.; Araujo, O.; Morales, D. A. Estimating the Connectivity Index of a Saturated Hydrocarbon. Indian J. Chem. 2000, 39A, 381-385.
49. Gutnam, I.; Araujo, O.; Rada, J. Acta Chim. Hungarica Models Chem. 2000, 137, 653.
50. Gutnam, I.; Miljkovic, O. Molecules with Smallest Connectivity Indices. Comm. Math. Chem. (Match) 2000, 41, 57-70.
51. Fowler, P. W.; Hansen, P.; Caporossi, G.; Soncini, A. Polyenes with Maximum HOMO-LUMO Gap (Variable Neighborhood for Extremal Graphs 7.). Chem. Physics Lett. 2001, 342, 105-112.
52. Shao, J. Y.; Hong, Y. Bounds on the Smallest Positive Eigenvalue of a Tree with Perfect Matchings. Chinese Sci. Bull. 1992, 37, 713-717.
53. Randić, M. On Characterization of Molecular Branching. J. Am. Chem. Soc. 1975, 97, 6609-6615.
54. Yu, P. (in chinese). J. Math. Studies 1998, 31, 225.
55. Bollobás, B.; Erdös, P. Graphs of Extremal Weights. Ars Combinatoria 1998, 50, 225-233.