On the Extremal Zagreb Indices of n\mathbf{\textit{n}}-Vertex Chemical Trees with Fixed Number of Segments or Branching Vertices

preprint2019arXivOpen access

Abstract

Let CTn,k\mathcal{CT}_{n,k} and CTn,b∗\mathcal{CT}^*_{n,b} be the classes of all nn-vertex chemical trees with kk segments and bb branching vertices, respectively, where 3≤k≤n−13\le k\le n-1 and 1≤b<n2−11\le b< \frac{n}{2}-1. The solution of the problem of finding trees from the class CTn,k\mathcal{CT}_{n,k} or CTn,b∗\mathcal{CT}^*_{n,b}, 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.