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 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
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
Wiener index in graphs given girth, minimum, and maximum degrees
Theory and Applications of Graphs, 2023 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$.
Fadekemi J. Osaye +3 more
doaj +1 more source
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 +1 more source
Eccentricity based topological indices of face centered cubic lattice FCC(n)
Main Group Metal Chemistry, 2021 Chemical graph theory has become a prime gadget for mathematical chemistry due to its wide range of graph theoretical applications for solving molecular problems.
Shaker Hani +2 more
doaj +1 more source
Sharp bounds and normalization of Wiener-type indices. [PDF]
PLoS ONE, 2013 Complex networks abound in physical, biological and social sciences. Quantifying a network's topological structure facilitates network exploration and analysis, and network comparison, clustering and classification.
Dechao Tian, Kwok Pui Choi
doaj +1 more source
The wiener index of the zero-divisor graph for a new class of residue class rings
Frontiers in Chemistry, 2022 The zero-divisor graph of a commutative ring R, denoted by Γ(R), is a graph whose two distinct vertices x and y are joined by an edge if and only if xy = 0 or yx = 0.
Yinhu Wei, Ricai Luo
doaj +1 more source