%0 Conference Paper %1 mohammadrezafarahani2010hosoya %A Farahani, Mohammad Reza %B ETRA %D 2013 %K Harary Hosoya Hyper-Wiener Index Network Protocols Regular Topological Wiener distance graph graph. index polynomial %N 1 %P 09 - 13 %T Hosoya polynomial, Wiener and Hyper-Wiener indices of some regular graphs %U http://airccse.org/journal/ieij/vol1.html %V 1 %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. 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.

@inproceedings{mohammadrezafarahani2010hosoya, 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. 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 = {2020-04-01T06:14:44.000+0200}, author = {Farahani, Mohammad Reza}, biburl = {https://www.bibsonomy.org/bibtex/2c29a6462b3bf9d994ebb537595a82bed/ieij1}, booktitle = {ETRA}, ee = {https://doi.org/10.1145/1743666.1743709}, interhash = {7c22f676e4beceaf2c7244fd3d0ba024}, intrahash = {c29a6462b3bf9d994ebb537595a82bed}, keywords = {Harary Hosoya Hyper-Wiener Index Network Protocols Regular Topological Wiener distance graph graph. index polynomial}, month = {December}, number = 1, pages = {09 - 13}, timestamp = {2020-04-01T06:14:44.000+0200}, title = {Hosoya polynomial, Wiener and Hyper-Wiener indices of some regular graphs}, url = {http://airccse.org/journal/ieij/vol1.html}, volume = 1, year = 2013 }