Journal of Chemical Information and Modeling · 2005 · 75 citations · 14 references
Natural SciencesChemistryComputational ChemistryPhysical ChemistryStructure-activity RelationshipsGraph AlgorithmsGraph TheoryMolecular DescriptorsQuantitative Structure-activity RelationshipsChemical Neighborhood AnalysisChemical Reaction NetworksExtremal IndexNeighborhood SearchTree AlgorithmsTree-graphVariable Neighborhood Search
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.
14
Characterization of molecular branching
Milan Randić · Journal of the American Chemical Society · 1975 · 3.6K citations
Graph theory and molecular orbitals. XII. Acyclic polyenes
İvan Gutman, B. Ru ić, Nenad Trinajstić et al. · The Journal of Chemical Physics · 1975 · 816 citations
Natural Sciences, Chemistry, Physics +11
Molecular connectivity in structure-activity analysis
Ian W. Nowell · Endeavour · 1986 · 596 citations
Variable neighborhood search for extremal graphs
Gilles Caporossi, İvan Gutman, Pierre Hansen · Computers & Chemistry · 1999 · 246 citations