𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The hyper-Wiener index of graph operations

✍ Scribed by M.H. Khalifeh; H. Yousefi-Azari; A.R. Ashrafi

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
271 KB
Volume
56
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

Graph operations

C 4 nanotube C 4 nanotorus q-multi-walled nanotube a b s t r a c t Let G be a graph. The distance d(u, v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined

In this paper the hyper-Wiener indices of the Cartesian product, composition, join and disjunction of graphs are computed. We apply some of our results to compute the hyper-Wiener index of C 4 nanotubes, C 4 nanotori and q-multi-walled polyhex nanotori.

πŸ“œ SIMILAR VOLUMES

-Wiener index of composite graphs
-Wiener index of composite graphs
✍ A. Hamzeh; S. Hossein-Zadeh; A.R. Ashrafi πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 218 KB

Eliasi and Taeri [Extension of the Wiener index and Wiener polynomial, Appl. Math. Lett. 21 (2008) 916-921] introduced the notion of y-Wiener index of graphs as a generalization of the classical Wiener index and hyper Wiener index of graphs. They obtained some mathematical properties of this new def

Relationship between the Hosoya polynomi
Relationship between the Hosoya polynomial and the hyper-Wiener index
✍ G.G. Cash πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 256 KB

The Hosoya polynomial of a graph, H(G, z), has the property that its first derivative, evaluated at z = 1, equals the Wiener index, i.e ., W(G) = H'(G, 1). In this paper, an equation is presented that gives the hyper-Wiener index, WW(G), in terms of the first and second derivatives of H(G,z). ## A

The Szeged and the Wiener index of graph
The Szeged and the Wiener index of graphs
✍ S. KlavΕΎar; A. Rajapakse; I. Gutman πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 283 KB
The Wiener index of the th power of a gr
The Wiener index of the th power of a graph
✍ Xinhui An; Baoyindureng Wu πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 289 KB

The kth power of a graph G, denoted by G k , is a graph with the same vertex set as G such that two vertices are adjacent in G k if and only if their distance is at most k in G. The Wiener index is a distance-based topological index defined as the sum of distances between all pairs of vertices in a