On the Wiener Index of Trees with Fixed Diameter Page 1 On the Wiener Index of Trees with
Fixed Diameter Huiqing LIU1,∗and Xiang-Feng PAN2,† 1School of Mathematics and Computer …

Let G be a graph, e= uv∈ E (G), nu (e) be the number of vertices of G lying closer to u than
to v and nv (e) be the number of vertices of G lying closer to v than to u. The vertex PI and …

Hosoya Polynomials of Circumcoronene Series Page 1 Hosoya Polynomials of Circumcoronene
Series Xiaoxia Lin a Shou-Jun Xu b ∗ Yeong-Nan Yeh c a School of Sciences, Jimei …

Hosoya polynomials of zig-zag open-ended nanotubes∗ Page 1 Hosoya polynomials of zig-zag
open-ended nanotubes∗ Shoujun Xua, Heping Zhanga, Mircea V. Diudeab aSchool of …

The Hosoya polynomial of a chemical graph G is H (G, x)= ∑ {u, v\} ⊆ V (G) x^ d_G (u, v),
where d G (u, v) denotes the distance between vertices u and v. In this paper, we obtain …

The Wiener index of a graph G is defined as W (G)=∑ u, vd G (u, v), where d G (u, v) is the
distance between u and v in G and the sum goes over all the pairs of vertices. In this paper …

The Wiener index of a graph G, denoted by W (G), is the sum of all distances between pairs
of vertices in G. Originally called the path number and used to predict the boiling points of …

Let Γ be a simple connected graph with vertex set V (Γ). The eccentric distance sum (EDS for
short) of Γ is defined as ξ d (Γ)=∑ v∈ V (Γ) ε Γ (v) D Γ (v), where ɛ Γ (v) is the eccentricity of …

ƒ ƒ ƒ ƒ Page 1 American Journal of Applied Sciences 5 (12): 1754-1757, 2008 ISSN 1546-9239
© 2008 Science Publications Corresponding Author: A. Iranmanesh, Department of …

The Wiener index of a graph Gis defined as W (G)= 1/2 S {ij} Í v (G) d (ij) where V (G) is the
set of vertices of G and d (i, j) is the distance between vertices i and j. In this paper, we give …