Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as ( ) ( ) ( ) ( ) ( ) 2 u,v V G WW G d v u d v u , , . ∈ = + ∑ Also, the
Hosoya polynomial was introduced by H. Hosoya and define ( ) ( ) ( ) , u,v V G , .
d v u H G x x ∈ = ∑ In this paper, the Hosoya polynomial, Wiener index and Hyper-Wiener index of some regular graphs are determined.
%0 Thesis
%1 bartsch2001verstndlichkeit
%A Farahani, Mohammad Reza
%C Lübeck
%D 2013
%I Informatics Engineering, an International Journal (IEIJ)
%K Harary Hosoya Hyper-Wiener Index, Network Protocols, Regular Topological Wiener distance, graph, graph. index, polynomial,
%T HOSOYA POLYNOMIAL, WIENER AND HYPERWIENER
INDICES OF SOME REGULAR GRAPHS
%U http://airccse.org/journal/ieij/papers/1113ieij02.pdf
%X Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as ( ) ( ) ( ) ( ) ( ) 2 u,v V G WW G d v u d v u , , . ∈ = + ∑ Also, the
Hosoya polynomial was introduced by H. Hosoya and define ( ) ( ) ( ) , u,v V G , .
d v u H G x x ∈ = ∑ In this paper, the Hosoya polynomial, Wiener index and Hyper-Wiener index of some regular graphs are determined.
@phdthesis{bartsch2001verstndlichkeit,
abstract = {Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as ( ) ( ) ( ) ( ) ( ) 2 {u,v} V G WW G d v u d v u , , . ∈ = + ∑ Also, the
Hosoya polynomial was introduced by H. Hosoya and define ( ) ( ) ( ) , {u,v} V G , .
d v u H G x x ∈ = ∑ In this paper, the Hosoya polynomial, Wiener index and Hyper-Wiener index of some regular graphs are determined. },
added-at = {2018-09-26T13:55:26.000+0200},
address = {Lübeck},
author = {Farahani, Mohammad Reza},
biburl = {https://www.bibsonomy.org/bibtex/2fcce25d5205d4663ff03df6241f6be58/ieij1},
interhash = {7c22f676e4beceaf2c7244fd3d0ba024},
intrahash = {fcce25d5205d4663ff03df6241f6be58},
keywords = {Harary Hosoya Hyper-Wiener Index, Network Protocols, Regular Topological Wiener distance, graph, graph. index, polynomial,},
language = {english},
month = dec,
publisher = {Informatics Engineering, an International Journal (IEIJ)},
refid = {615153793},
timestamp = {2018-09-26T13:55:26.000+0200},
title = {HOSOYA POLYNOMIAL, WIENER AND HYPERWIENER
INDICES OF SOME REGULAR GRAPHS},
url = {http://airccse.org/journal/ieij/papers/1113ieij02.pdf},
year = 2013
}