Results 151 to 160 of about 32,921 (201)

Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltonicity Properties of graphs

Applied Mathematics-A Journal of Chinese Universities, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Gui-dong, Ren, Li-fang, Li, Xing-xing   +2 more
semanticscholar   +3 more sources

The Edge-Hyper-Wiener Index of Zigzag Single-Walled Nanotubes

Polycyclic Aromatic Compounds, 2022
A topological index is a numerical value associated with a graph structure that has some correlation with corresponding physical property, chemical reaction or biological activity.
Guangfu Wang, Yajing Liu, Jianxin Wei, Jia-Bao Liu   +3 more
openaire   +2 more sources

The maximum hyper-Wiener index of cacti

Journal of Applied Mathematics and Computing, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Dong-fang, Tan, Shang-wang
openaire   +3 more sources

Bounds on hyper-Wiener index of graphs

Asian-European Journal of Mathematics, 2017
The Wiener number [Formula: see text] of a graph [Formula: see text] was introduced by Harold Wiener in connection with the modeling of various physic-chemical, biological and pharmacological properties of organic molecules in chemistry. Milan Randić introduced a modification of the Wiener index for trees (acyclic graphs), and it is known as the hyper-
Alhevaz, Abdollah, Baghipur, Maryam, Rahimi, Sadegh   +2 more
openaire   +2 more sources

HYPER-WIENER INDEX ON LEVEL-3 SIERPINSKI GASKET

Fractals
The hyper-Wiener index plays an important role in chemical graph theory. In this paper, using the technique named finite pattern, we discuss the hyper-Wiener index on level-3 Sierpinski gasket which is a self-similar fractal.
JIAJUN XU, LIFENG XI
openaire   +2 more sources

Fractal version of hyper-Wiener index

Chaos, Solitons & Fractals, 2023
Ying Lu, Jiajun Xu, Lifeng Xi
openaire   +2 more sources

EDGE-HYPER-WIENER INDEX ON LEVEL-3 SIERPINSKI NETWORKS

Fractals
Using the technique of finite pattern, for level-3 Sierpinski networks, we obtain their exact formulae of edge-hyper-Wiener index, which is the sum of the distances and the square of distances between all pairs of edges.
CAIMIN DU, YIQI YAO, LIFENG XI
openaire   +2 more sources

A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees

Journal of Chemical Information and Computer Sciences, 2001
An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity is the best possible. Computational experience for alkanes is reported.
ARINGHIERI, ROBERTO, HANSEN P., MALUCELLI F.   +2 more
openaire   +4 more sources

More on edge hyper Wiener index of graphs

2017
Summary: Let \(G=(V(G),E(G))\) be a simple connected graph with vertex set \(V(G)\) and edge set \(E(G)\). The (first) edge-hyper Wiener index of the graph \(G\) is defined as: \[\begin{aligned} WW_e(G)&=\sum_{\{f,g\}\subseteq E(G)} (d_e(f,g|G)+d_e^2(f,g|G))\\&=\frac{1}{2}\sum_{f\in E(G)} (d_e(f|G)+d^2_e(f|G)), \end{aligned}\] where \(d_e(f,g|G ...
Alhevaz, A., Baghipur, M.
openaire   +2 more sources

Trees with Extremal Hyper-Wiener Index:  Mathematical Basis and Chemical Applications

Journal of Chemical Information and Computer Sciences, 1997
Trees with minimal and maximal hyper-Wiener indices (WW) are determined:  Among n-vertex trees, minimum and maximum WW is achieved for the star-graph (Sn) and the path-graph (Pn), respectively. Since WW(Sn) is a quadratic polynomial in n,, whereas WW(Pn) is a quartic polynomial in n, the hyper-Wiener indices of all n-vertex trees assume values from a ...
Ivan Gutman, Wolfgang Linert, István Lukovits, Andrey A. Dobrynin   +3 more
openaire   +2 more sources