Results 11 to 20 of about 28,315 (192)
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.
Heydari, Abbas
openaire +3 more sources
An algorithm for the calculation of the hyper-Wiener index of benzenoid hydrocarbons [PDF]
Computers & Chemistry, 2000 An algorithm for the calculation of the hyper-Wiener index (WW) of benzenoid hydrocarbons (both cata- and pericondensed) is described, based on the consideration of pairs of elementary cuts of the corresponding benzenoid graph B. A pair of elementary cuts partitions the vertices of B into four classes.
Sandi Klavžar, Ivan Gutman
exaly +3 more sources
Note on the Hyper-Wiener Index [PDF]
Journal of the Serbian Chemical Society, 2003 The hyper-Wiener index WW of a chemical tree T is defined as the sum of the products n1n2, over all pairs u, u of vertices of T, where n1 and n2 are the number of vertices of T, lying on the two sides of the path which connects u and u.
IVAN GUTMAN +2 more
doaj +1 more source
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 edge-Wiener index and the edge-hyper-Wiener index of phenylenes [PDF]
Discrete Applied Mathematics, 2019 Besides the well known Wiener index, which sums up the distances between all the pairs of vertices, and the hyper-Wiener index, which includes also the squares of distances, the edge versions of both indices attracted a lot of attention in the recent years.
exaly +3 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
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
Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2
Journal of Function Spaces, 2022 Let S=ℤℊ3×ℤI1I2 be a commutative ring where ℊ,I1 and I2 are positive prime integers with I1≠I2. The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y(S)) consisting of all Zero-divisor of the ring S and for any c,
Yonghong Liu +4 more
doaj +2 more sources
Relationship between the Hosoya polynomial and the hyper-Wiener index
Applied Mathematics Letters, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
Croatica Chemica Acta, 2004 If two edges e and f are deleted from a tree T, then it decomposes into three components, possessing, n0(e, f ), n1(e, f ), and n2(e, f ) vertices. Let n0(e, f ) count the vertices lying between the edges e and f. It is shown that the Wiener index W of the tree T is equal to the sum over all edges e of the products n1(e, e) • n2(e, e), and that the ...
Gutman, Ivan, Ivan Gutman
openaire +3 more sources