Volume 6, Issue 2 (11-2011)
IJMSI 2011, 6(2): 67-74 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
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
URL: http://ijmsi.ir/article-1-238-en.html
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.
Keywords: Hyper-Wiener polynomial, graph operation.
Type of Study: Research paper |
Subject:
General
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
