Recently Hansen and Vukičević [10] proved that the inequality M1/n ≤ M2/m, where M1 and M2 are the first and second Zagreb indices, holds for chemical graphs, and Vukičević and Graovac [17] proved that this also holds for trees. In both works is given a distinct counterexample for which this inequality is false in general. Here, we present some classes of graphs with prescribed degrees, that sa...

A bound on the values of independence polynomials at-1/k for k-degenerate graphs", Discrete Mathematics 2013 (To appear) Estes, Staton, Wei. " A bound on the values of independence polynomials at-1/k for k-degenerate graphs " Discrete Mathematics.

Topological indices play an important role in Mathematical Chemistry especially in the quantitative structure-property relationship (QSPR) and quantitative structureactivity relationship (QSAR). Recent research indicates that the augmented Zagreb index (AZI) possess the best correlating ability among several topological indices. The main purpose of the current study is to establish some mathema...

In the research of QSAR and QSPR correlations, topological indices such as Randi’c index, Zagreb ABC geometric-arithmetic index have been proposed to analyze bio-compatibility chemical compounds. Chemical graph theory is combination Chemistry Graph theory, this deals with topology mathematical study isomerism development which has applications in QSPR. article, we consider Octahedron networks f...

‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

The atom-bond connectivity (ABC) index, introduced by Estrada et al. in 1998, displays an excellent correlation with the formation heat of alkanes. We give upper bounds for this graph invariant using the number of vertices, the number of edges, the Randić connectivity indices, and the first Zagreb index. We determine the unique tree with the maximum ABC index among trees with given numbers of v...