作者: Gilles Caporossi , Ivan Gutman , Pierre Hansen
DOI: 10.1016/S0097-8485(99)00031-5
关键词: Topological index 、 Chemical graph theory 、 Combinatorics 、 Extremal graph theory 、 Connectivity 、 Windmill graph 、 Mathematics 、 Discrete mathematics 、 Vertex (graph theory) 、 Trémaux tree 、 Block graph
摘要: Abstract By means of the variable neighborhood search algorithm, a newly designed heuristic approach to combinatorial optimization, we established structure chemical trees possessing extremal (maximal and minimal) values for Randic connectivity index ( χ ). These findings were eventually corroborated by rigorous mathematical proofs. As could have been anticipated, n -vertex tree with maximum is path. The minimum -value not unique. structures such (which should be considered as graph representations most branched alkanes) are fully characterized.