Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees

Chemical graphs, as other ones, are regular if all their vertices have the same degree. Otherwise, they are irregular, and it is of interest to measure their irregularity both for descriptive purposes and for QSAR/QSPR studies. Three indices have been proposed in the literature for that purpose: those of Collatz-Sinogowitz, of Albertson, and of Bell's variance of degrees. We study their properties for the case of chemical trees. Structural conjectures are generated with the system AutoGraphiX, and most of them proved later by mathematical means. Analytical expressions for extremal values are obtained, and extremal graphs are characterized for the two last indices.

[1]  L. Collatz,et al.  Spektren endlicher grafen , 1957 .

[2]  L. Lovász,et al.  On the eigenvalues of trees , 1973 .

[3]  I. Gutman,et al.  Graph theory and molecular orbitals. XII. Acyclic polyenes , 1975 .

[4]  M. Randic.  Characterization of molecular branching , 1975 .

[5]  L. Hall,et al.  Molecular connectivity in chemistry and drug research , 1976 .

[6]  I. Gutman,et al.  Mathematical Concepts in Organic Chemistry , 1986 .

[7]  S. Unger.  Molecular Connectivity in Structure–activity Analysis , 1987 .

[8]  A. Balaban.  Topological indices and their uses: A new approach for the coding of alkanes , 1988 .

[9]  Jerry Ray Dias,et al.  Chemical Applications of Graph Theory , 1992 .

[10]  F. K. Bell.  A note on the irregularity of graphs , 1992 .

[11]  D. Manolopoulos,et al.  An Atlas of Fullerenes , 1995 .

[12]  Michael O. Albertson,et al.  The Irregularity of a Graph , 1997, Ars Comb..

[13]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index , 1998, Comput. Chem..

[14]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy , 1998, J. Chem. Inf. Comput. Sci..

[15]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system , 1997, Discret. Math..

[16]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs 8: Variations on Graffiti 105 , 2001 .

[17]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph , 2001, Graphs and Discovery.

[18]  I. Gutman,et al.  Wiener Index of Trees: Theory and Applications , 2001 .

[19]  P. Hansen,et al.  Polyenes with maximum HOMO–LUMO gap ☆ , 2001 .

[20]  I. Gutman.  The Energy of a Graph: Old and New Results , 2001 .

[21]  Dieter Rautenbach,et al.  Wiener index versus maximum degree in trees , 2002, Discret. Appl. Math..

[22]  I. Gutman,et al.  The largest eigenvalues of adjacency and Laplacian matrices, and ionization potentials of alkanes , 2002 .

[23]  I. Gutmana,et al.  Extremal Chemical Trees , 2002 .

[24]  Roberto Todeschini,et al.  Handbook of Molecular Descriptors , 2002 .

[25]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index , 2001, J. Chem. Inf. Comput. Sci..

[26]  Dieter Rautenbach,et al.  A Linear-programming Approach to the Generalized Randic Index , 2003, Discret. Appl. Math..

[27]  N. Trinajstic,et al.  The Zagreb Indices 30 Years After , 2003 .

[28]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures , 2000, Discret. Math..

[29]  K. Wanner,et al.  Methods and Principles in Medicinal Chemistry , 2007 .