𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Wiener index of the th power of a graph

✍ Scribed by Xinhui An; Baoyindureng Wu


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
289 KB
Volume
21
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis


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 graph. In this note, we give the bounds on the Wiener index of the graph G k . The Nordhaus-Gaddum-type inequality for the Wiener index of the graph G k is also presented.


πŸ“œ SIMILAR VOLUMES


The hyper-Wiener index of graph operatio
✍ 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
✍ S. KlavΕΎar; A. Rajapakse; I. Gutman πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 283 KB
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

The cochromatic index of a graph
✍ Lowell Beineke; Richard Ringeisen; H.Joseph Straight πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 684 KB

We discuss partitions of the edge set of a graph into subsets which are uniform in their internal relationships; i.e., the edges are independent, they are incident with a common vertex (a star), or three edges meet in a triangle. We define the cochromatic index z'(G) of G to be the minimum number of