G. H. Fath-Tabar

Learn More
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 W W (G, x) = 1/2 {a,b}⊆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(More)
  • 1