Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4627415 | Applied Mathematics and Computation | 2014 | 12 Pages |
Abstract
A dynamic programming method is elaborated, enabling the characterization of trees with a given number of pendent vertices, for which a vertex-degree-based invariant (“topological index”) achieves its extremal value. The method is applied to the chemically interesting and earlier much studied such invariants: the first and second Zagreb index, and the atom-bond connectivity index.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Mikhail Goubko, Ivan Gutman,