Abstract

The Augmented Zagreb index of a graph $G$ is defined to be $\mathcal {AZI}\left ({G}\right) =\sum _{uv\in E\left ({G}\right) } \left ({\frac { d\left ({u}\right) d\left ({v}\right) }{d\left ({u}\right) +d\left ({v}\right) -2} }\right) ^{3}$ , where $E\left ({G}\right) $ is the edge set of $G$ , $d\left ({u}\right) $ and $d\left ({v}\right) $ are the degrees of the vertices $u$ and $v$ of edge $uv$ . It is one of the most valuable topological indices used to predict the structure-property correlations of organic compounds. It is well known that the star is the unique tree having minimal $\mathcal {AZI}$ among trees. However, the problem of finding the tree with maximal $\mathcal {AZI}$ is still open and seems to be a very difficult problem. A recent conjecture, posed in the recent paper [IEEE Access, vol. 6, pp. 69335–69341, 2018], states that the balanced double star is the tree with maximal $\mathcal {AZI}$ among all trees with $n$ vertices, for all $n\geq 19$ . Let $\Omega \left ({n,p}\right) $ be the set of trees with $n$ vertices and $p$ branching vertices. In this paper we consider the maximal value problem of $\mathcal {AZI}$ over $\Omega \left ({n,p}\right) $ . We first show that under a certain condition, the problem reduces to finding the maximal value of $\mathcal {AZI}$ over $\Omega _{1}\left ({n,p}\right) $ , the set of trees in $\Omega \left ({n,p}\right) $ with no vertices of degree 2. Then we rely on this result to find the trees with maximal value of $\mathcal {AZI}$ over $\Omega \left ({n,p}\right) $ , when $p=2$ and 3. In particular, we deduce that the conjecture holds for all trees with at most 3 branching vertices.

Highlights

  • Our graphs in this study are simple and finite

  • If uv ∈ E (G) we denote by G − uv the graph obtained from G by deleting the edge uv; if uv ∈ E (G) G + uv denotes the graph obtained from G by adding the edge uv

  • A vertex u of a tree T is called a branching vertex if d(u) ≥ 3; it is called a leaf if d(u) = 1

Read more

Summary

INTRODUCTION

Our graphs in this study are simple (no loops and no multiple edges) and finite. We denote the vertex set and the edge set of a graph G as V (G) and E (G), respectively. We denote by (n, p) the set of all n-vertex trees with exactly p branching vertices. A topological index is a numeric quantity associated with a graph which is invariant under graph isomorphism In theoretical chemistry it is used for modeling physico-chemical properties of chemical compounds [5], [10], [11], [16], [17]. The Augmented Zagreb index, introduced by Furtula et al [6], was shown to be the best in correlating abilities among many other topological indices, in the case of standard heats of formation and normal boiling points of octane isomers [7] It has the greatest structure sensitivity and it is the best for designing quantitative structure-property relations [8]. R. Cruz et al.: Maximal Augmented Zagreb Index of Trees With at Most Three Branching Vertices.

AUGMENTED ZAGREB INDEX OF TREES WITH A FIXED
CONCLUSION

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.