دوره 6، شماره 2 - ( 8-1390 )                   جلد 6 شماره 2 صفحات 67-74 | برگشت به فهرست نسخه ها

DOI: 10.7508/ijmsi.2011.02.007


XML Print


چکیده:  

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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى