@ARTICLE{Fath-Tabar,
author = {Fath-Tabar, G.H. and Ashrafi, A.R. and },
title = {The Hyper-Wiener Polynomial of Graphs},
volume = {6},
number = {2},
abstract ={The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are computed. },
URL = {http://ijmsi.ir/article-1-238-en.html},
eprint = {http://ijmsi.ir/article-1-238-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {10.7508/ijmsi.2011.02.007},
year = {2011}
}