The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $n\geqslant 10$ are ...
Huihui Zhang, Jing Chen, Shuchao Li
doaj +3 more sources
On the Wiener Complexity and the Wiener Index of Fullerene Graphs
Mathematics, 2019 Fullerenes are molecules that can be presented in the form of cage-like polyhedra, consisting only of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules.
Andrey A. Dobrynin, Andrei Yu Vesnin
doaj +3 more sources
Quantitative structure–activity relationship based modeling of substituted indole Schiff bases as inhibitor of COX-2 [PDF]
Journal of Saudi Chemical Society, 2016 We have performed the quantitative structure activity relationship (QSAR) study for N-1 and C-3 substituted indole shiff bases to understand the structural features that influence the inhibitory activity toward the cyclooxygenase-2 (COX-2) enzyme.
Amrita Dwivedi +2 more
doaj +3 more sources
Efficient algorithm on exponential Wiener index and QSPR analysis of alkanes and benzenoid hydrocarbons [PDF]
Scientific ReportsAny graph that depicts a particular molecular structure can be given a topological graph index, also known as a molecular descriptor. From this index, it is possible to examine numerical data and learn more about some of the physical characteristics of a
S. Punitha, K. Kannan, A. Menaga
doaj +2 more sources
Wiener index in graphs with given minimum degree and maximum degree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n \choose 2}$ on ...
Peter Dankelmann, Alex Alochukwu
doaj +1 more source
Five results on maximizing topological indices in graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence number.
Stijn Cambie
doaj +1 more source
The n-Wiener Polynomials of Straight Hexagonal Chains and Kt×Cr [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2009 The n-Wiener polynomials of straight hexagonal chains and the Cartesian product of a complete graph Kr and a cycle Cr are obtained in this paper. The n-diameter and the n-Wiener index of each such graphs are also determined.
Ali Ali, Haveen Ahmed
doaj +1 more source
The inverse Wiener polarity index problem for chemical trees. [PDF]
PLoS ONE, 2018 The Wiener polarity number (which, nowadays, known as the Wiener polarity index and usually denoted by Wp) was devised by the chemist Harold Wiener, for predicting the boiling points of alkanes.
Zhibin Du, Akbar Ali
doaj +1 more source
The n-Hosoya Polynomials of the Square of a Path and of a Cycle [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2021 The n-Hosoya polynomial of a connected graph G of order t is defined by: Hn (G;x) = ∑ Cn (G;x) xk, where, Cn(G,k) is the number of pairs (v,S), in which |S| = n -1, 3 ≤ n ≤ t, v ∈ V(G) , S ⊆ V (G) , such that
Ahmed Ali
doaj +1 more source
Comparison of the Wiener and Kirchhoff Indices of Random Pentachains
Journal of Mathematics, 2021 Let G be a connected (molecule) graph. The Wiener index WG and Kirchhoff index KfG of G are defined as the sum of distances and the resistance distances between all unordered pairs of vertices in G, respectively.
Shouliu Wei +3 more
doaj +1 more source