Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1701.02859

Predicting some physicochemical properties of octane isomers: A topological approach using ev-degree and ve-degree Zagreb indices

Süleyman Ediz
View original source ↗Read source document ↗Export metadata ↓

Abstract

Topological indices have important role in theoretical chemistry for QSPR researches. Among the all topological indices the Randić and the Zagreb indices have been used more considerably than any other topological indices in chemical and mathematical literature. Most of the topological indices as in the Randić and the Zagreb indices are based on the degrees of the vertices of a connected graph. Recently novel two degree concepts have been defined in graph theory; ev-degrees and ve-degrees. In this study we define ev-degree Zagreb index, ve-degree Zagreb indices and ve-degree Randić index by using these new graph invariants as parallel to their corresponding classical degree versions. We compare these new group ev-degree and ve-degree indices with the other well-known and most used topological indices in literature such as; Wiener, Zagreb and Randić indices by modelling some physicochemical properties of octane isomers. We show that the ev-degree Zagreb index, the ve-degree Zagreb and the ve-degree Randić indices give better correlation than Wiener, Zagreb and Randić indices to predict the some specific physicochemical properties of octanes. We investigate the relations between the second Zagreb index and ev-degree and ve-degree Zagreb indices and some mathematical properties of ev-degree and ve-degree Zagreb indices. Keywords:

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Süleyman Ediz. 2017-01-11. Predicting some physicochemical properties of octane isomers: A topological approach using ev-degree and ve-degree Zagreb indices. https://arxiv.org/abs/1701.02859

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗