Results 11 to 20 of about 21,361 (171)
On the Wiener index and the hyper-Wiener index of the Kragujevac trees
Proyecciones (Antofagasta), 2023 In this paper, the Wiener index and the hyper-Wiener index of the Kragujevac trees is computed in term of its vertex degrees. As application, we obtain an upper bond and a lower bound for the Wiener index and the hyper-Wiener index of these trees.
A. Heydari
semanticscholar +3 more sources
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 Similarly to Wiener index, hyper-Wiener index of a connected graph is a widely applied topological index measuring the compactness of the structure described by the given graph. Hyper-Wiener index is the sum of the distances plus the squares of distances
Mujahed Hamzeh, Nagy Benedek
doaj +2 more sources
The hyper-Wiener index of graph operations
Computers and Mathematics With Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H Yousefi-Azari, A R Ashrafi
exaly +4 more sources
The Hyper-Wiener Index of Trees of Order n with Diameter d
Discrete Dynamics in Nature and Society, 2016 The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener index WW(G) is defined as WW(G)=1/2∑u,v∈VGdGu,v+dG2u,v with the summation going over all pairs of ...
Gaixiang Cai +4 more
doaj +2 more sources
Journal of Chemistry, 2019 In this paper, with respect to the Wiener index, hyper-Wiener index, and Harary index, it gives some sufficient conditions for some graphs to be traceable, Hamiltonian, Hamilton-connected, or traceable for every vertex.
Guisheng Jiang, Lifang Ren, Guidong Yu
doaj +2 more sources
Three Methods for Calculation of the Hyper-Wiener Index of Molecular Graphs [PDF]
Journal of Chemical Information and Computer Sciences, 2002 The hyper-Wiener index WW of a graph G is defined as WW(G) = (summation operator d (u, v)(2) + summation operator d (u, v))/2, where d (u, v) denotes the distance between the vertices u and v in the graph G and the summations run over all (unordered) pairs of vertices of G.
G. Cash, S. Klavžar, M. Petkovšek
semanticscholar +4 more sources
Hyper-Wiener indices of polyphenyl chains and polyphenyl spiders
Open Mathematics, 2019 Let G be a connected graph and u and v two vertices of G. The hyper-Wiener index of graph G is WW(G)=12∑u,v∈V(G)(dG(u,v)+dG2(u,v))$\begin{array}{} WW(G)=\frac{1}{2}\sum\limits_{u,v\in V(G)}(d_{G}(u,v)+d^{2}_{G}(u,v)) \end{array}$, where dG(u, v) is the ...
Wu Tingzeng, Lü Huazhong
doaj +2 more sources
The structure of graphs with extremal hyper-Wiener index
FilomatThe hyper-Wiener index of a graph G is defined as WW(G) = 1/2 ?{u,v}?V(G) (d2G(u,v)+dG(u,v)), where dG(u,v) denotes the distance between u and v in G. In this paper, we determine the maximum hyper-Wiener index of 2-connected graphs and 2-edge-connected ...
He-Chao Liu, Lihua You, Yu-Fei Huang
semanticscholar +2 more sources
Hyper Wiener Index of Concatenated Pentagons in Two Rows
International Journal of Scientific and Innovative Mathematical Research, 2018 In straight chaining (second case) the graph consisting of 5-cycles in two rows with ‘b’ cycles in row 1 and ‘a’ cycles in row 2 denoted by G(a,b,S2) is as shown below.
M. Srujana, N. Rao
semanticscholar +2 more sources
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