Results 1 to 10 of about 4,539,869 (304)
On the Wiener Complexity and the Wiener Index of Fullerene Graphs [PDF]
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 +6 more sources
On Wiener Polarity Index and Wiener Index of Certain Triangular Networks
Journal of Chemistry, 2021 A topological index of graph G is a numerical quantity which describes its topology. If it is applied to the molecular structure of chemical compounds, it reflects the theoretical properties of the chemical compounds. A number of topological indices have
Mr. Adnan +2 more
doaj +3 more sources
Wiener index for an intuitionistic fuzzy graph and its application in water pipeline network
Ain Shams Engineering Journal, 2023 The usefulness of different topological indices is inevitable in various fields such as Chemistry, Electronics, Economics and Business studies, medical and social sciences. The “purpose of this paper is to study” Wiener index for the Intuitionistic fuzzy
Javeria Dinar +3 more
doaj +4 more sources
The Wiener index, degree distance index and Gutman index of composite hypergraphs and sunflower hypergraphs. [PDF]
Heliyon, 2022 Topological invariants are numerical parameters of graphs or hypergraphs that indicate its topology and are known as graph or hypergraph invariants. In this paper, topological indices of hypergraphs such as Wiener index, degree distance index and Gutman ...
Ashraf S +3 more
europepmc +2 more sources
Generalizations of Wiener Polarity Index and Terminal Wiener Index [PDF]
Graphs and Combinatorics, 2012 In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. We introduce a generalized Wiener polarity index $W_k (G)$ as the number of unordered pairs of vertices ${u, v}$ of $G$ such that the shortest distance $d (u, v)$ between $u$ and $
Ilić, Aleksandar, Ilić, Milovan
openaire +3 more sources
South East Asian J. of Mathematics and Mathematical Sciences, 2022 In this short paper, we establish formulae to compute Wiener index, reciprocal Wiener index and peripheral Wiener index of graphs using adjacency matrix.
R. Rajendra, P. Reddy, M. Prabhavathi
semanticscholar +3 more sources
The Wiener index of signed graphs [PDF]
Applied Mathematics and Computation, 2021 The Wiener index of a graph W (G) is a well studied topological index for graphs. An outstanding problem of Šoltés is to find graphs G such that W (G) = W (G − v) for all vertices v ∈ V (G), with the only known example being G = C11.
Sam Spiro
semanticscholar +5 more sources
Wiener index of quadrangulation graphs [PDF]
Discrete Applied Mathematics, 2020 The Wiener index of a graph $G$, denoted $W(G)$, is the sum of the distances between all pairs of vertices in $G$. E. Czabarka, et al. conjectured that for an $n$-vertex, $n\geq 4$, simple quadrangulation graph $G$, \begin{equation*}W(G)\leq \begin ...
E. Györi, Addisu Paulos, Chuanqi Xiao
semanticscholar +3 more sources
Upgrading the Wiener index [PDF]
Journal of the Serbian Chemical Society, 2002 The Wiener index Wis the oldest molecular-graph-based structure-descriptor. It is defined as the sum of the distances of all pairs of vertices of the molecular graph G, where the distance is the number of edges in the shortest path connecting the ...
Castro Eduardo A. +3 more
doaj +5 more sources
Wiener Index and Remoteness in Triangulations and Quadrangulations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and quadrangulations with ...
É. Czabarka +3 more
semanticscholar +3 more sources