TY - JOUR
T1 - The Hyper-Wiener Polynomial of Graphs
TT -
JF - IJMSI
JO - IJMSI
VL - 6
IS - 2
UR - http://ijmsi.ir/article-1-238-en.html
Y1 - 2011
SP - 67
EP - 74
KW - Hyper-Wiener polynomial
KW - graph operation.
N2 - 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.
M3 10.7508/ijmsi.2011.02.007
ER -