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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
