Volume 6, Issue 2 (11-2011)                   IJMSI 2011, 6(2): 67-74 | Back to browse issues page

DOI: 10.7508/ijmsi.2011.02.007

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Fath-Tabar G, Ashrafi A. The Hyper-Wiener Polynomial of Graphs. IJMSI. 2011; 6 (2) :67-74
URL: http://ijmsi.ir/article-1-238-en.html


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.

Type of Study: Research | Subject: General

Add your comments about this article : Your username or Email:
Write the security code in the box

© 2015 All Rights Reserved | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb