𝔖 Bobbio Scriptorium
✦   LIBER   ✦

-Wiener index of composite graphs

✍ Scribed by A. Hamzeh; S. Hossein-Zadeh; A.R. Ashrafi

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
218 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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 defined topological index. In this paper, the join, Cartesian product, composition, disjunction and symmetric difference of graphs under y-Wiener index are computed. By these results most parts of a paper by Sagan et al. [The Wiener polynomial of a graph, Int. J. Quant. Chem. 60 (1996) 959-969] and another paper by Khalifeh et al. [The hyper-Wiener index of graph operations, Comput. Math. Appl. 56 (2008) 1402-1407] are generalized.

πŸ“œ SIMILAR VOLUMES

The hyper-Wiener index of graph operatio
The hyper-Wiener index of graph operations
✍ M.H. Khalifeh; H. Yousefi-Azari; A.R. Ashrafi πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 271 KB

## 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 verti

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

The Wiener polynomial of a graph
The Wiener polynomial of a graph
✍ Bruce E. Sagan; Yeong-Nan Yeh; Ping Zhang πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 674 KB

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some