The Hyper-Wiener Polynomial of Graphs

Author(s):

G.H. Fath-Tabar , A.R. Ashrafi

Message:
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.
Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:6 Issue: 2, Nov 2011
Pages:
67 to 74
https://www.magiran.com/p909378