Abstract
Let and be the classes of all -vertex chemical trees with segments and branching vertices, respectively, where and . The solution of the problem of finding trees from the class or , with the minimum first Zagreb index or minimum second Zagreb index follows directly from the main results of [MATCH Commun. Math. Comput. Chem. 72 (2014) 825-834] or [MATCH Commun. Math. Comput. Chem. 74 (2015) 57-79]. In this paper, the chemical trees with the maximum first/second Zagreb index are characterized from each of the aforementioned graph classes.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.