Results 131 to 140 of about 15,243 (160)
Some of the next articles are maybe not open access.
More on edge hyper Wiener index of graphs
2017Summary: 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 +1 more source
A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees
Journal of Chemical Information and Computer Sciences, 2001An 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 +2 more
openaire +3 more sources
Hyper Wiener Index of C4C8(S) Nanotubes
Current Nanoscience, 2010The hyper Wiener index of a molecular graph is defined as one half of the sum of the distances and square distances between all (unordered) pairs of vertices of the graph. In this paper we find an exact formula for calculation of the hyper Wiener index of nanotubes which have square and octagon structure and denoted by C4C8(S) nanotubes.
openaire +1 more source
Hyper-Wiener Index vs. Wiener Index. Two Highly Correlated Structure-Descriptors
Monatshefte für Chemie - Chemical Monthly, 2003The Wiener (W) and hyper-Wiener (WW) indices of alkanes are found to be highly correlated. Hence, these two structure-descriptors pertain to the very same structural features of the underlying molecules and one of them may be viewed as superfluous. For alkane isomers with n carbon atoms, WW is bounded from both above and below by linear functions of W.
Ivan Gutman, Boris Furtula
openaire +1 more source
Relation between hyper-Wiener and Wiener index
Chemical Physics Letters, 2002Abstract An identity between the hyper-Wiener index ( WW ) and the Wiener index ( W ) of a tree is deduced, showing that these two molecular-structure-descriptors are more intimately connected than earlier believed. Let T be a tree on n vertices and e be its edge.
openaire +1 more source
On the Relation between W ‘/W Index, Hyper-Wiener Index, and Wiener Number
Journal of Chemical Information and Computer Sciences, 1999It is shown analytically that the W'/W index, the hyper-Wiener index, and the Wiener number are closely related graph-theoretical invariants for acyclic structures. A general analytical expression for the hyper-Wiener index of a tree is derived too.
Lerš, Nella +2 more
openaire +4 more sources
A Novel Definition of the Overall Hyper‐Wiener Index for Unsaturated Hydrocarbons.
ChemInform, 2004By replacing the distances between pairs of vertices with the relative distances, we define a novel overall hyper-Wiener index (NOR); the novel overall hyper-Wiener index extends the usefulness of the hyper-Wiener index and the overall hyper-Wiener index to unsaturated hydrocarbons.
Xinhua, Li, Maolin, Hu, Hongping, Xiao
openaire +2 more sources
Fractal version of hyper-Wiener index
Chaos, Solitons & Fractals, 2023Ying Lu, Jiajun Xu, Lifeng Xi
openaire +1 more source
Trees with Extremal Hyper-Wiener Index: Mathematical Basis and Chemical Applications
Journal of Chemical Information and Computer Sciences, 1997Trees 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 +3 more
openaire +1 more source
EDGE-HYPER-WIENER INDEX ON LEVEL-3 SIERPINSKI NETWORKS
FractalsUsing 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 +1 more source

