Search arXivSearch

arXiv · 1709.01832

Predicting Melting Points by the Graovac-Pisanski Index

Abstract

Theoretical molecular descriptors alias topological indices are a convenient means for expressing in a numerical form the chemical structure encoded in a molecular graph. The structure descriptors derived from molecular graphs are widely used in Quantitative Structure-Property Relationship (QSPR) and Quantitative Structure-Activity Relationship (QSAR). In this paper, we are interested in the Graovac-Pisanski index (also called modified Wiener index) introduced in 1991 by Graovac and Pisanski, which encounters beside the distances in a molecular graph also its symmetries. In the QSPR analysis we first calculate the Graovac-Pisanski index for different families of hydrocarbon molecules using a simple program and then we show a correlation with the melting points of considered molecules. We show that the melting points of the alkane series can be very effectively predicted by the Graovac-Pisanski index and for the rest of considered molecules (PAH's and octane isomers) the regression models are different, but we establish some correlation with the melting points for them as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matevž Črepnjak, Niko Tratnik, Petra Žigert Pleteršek. 2017-09-05. Predicting Melting Points by the Graovac-Pisanski Index. https://doi.org/10.1080/1536383x.2017.1386657

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