Search arXivSearch

arXiv · 1401.7514

More on Comparison Between First Geometric-Arithmetic Index and Atom-Bond Connectivity Index

Abstract

The first geometric-arithmetic (GA) index and atom-bond connectivity (ABC) index are molecular structure descriptors which play a significant role in quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR) studies. Das and Trinajstić [\textit{Chem. Phys. Lett.} \textbf{497} (2010) 149-151] showed that $GA$ index is greater than $ABC$ index for all those graphs (except $K_{1,4}$ and $T^{*}$, see Figure 1) in which the difference between maximum and minimum degree is less than or equal to 3. In this note, it is proved that $GA$ index is greater than $ABC$ index for line graphs of molecular graphs, for general graphs in which the difference between maximum and minimum degree is less than or equal to $(2δ-1)^{2}$ (where $δ$ is the minimum degree and $δ\geq2$) and for some families of trees. Thereby, a partial solution to an open problem proposed by Das and Trinajstić is given.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zahid Raza, Akhlaq Ahmad Bhatti, Akbar Ali. 2015-06-12. More on Comparison Between First Geometric-Arithmetic Index and Atom-Bond Connectivity Index. https://doi.org/10.18514/mmn.2016.1265

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO