the hyper-Wiener index WW(G) of the graph G is defined as WW(G) =12{u
v}V(G)(d(u
v) + d2(u
v))
where d(u
v) denotes the distance between u and v of G. In this paper
we discuss mainly the hyper-Wiener index of trees with radius two and give the calculating formula. We also characterize graphs with the maximum hyper-Wiener index among all graphs of order n = 1 + t +87t2 with radius two
where t is some positive integer.Key words : hyper-Wiener index; Distance; Radius
关键词
Keywords
references
Bondy JA,Murty USR.Graph Theory with Applications[M].New York:Macmilan Press,1976.
Klein DJ,Lukovits I,Gutman I.On the definition of the hyper-Wiener index for cycle-containing structures[J].J Chem Inf Comput Sci,1995,35:50-52.
Feng LH,Ili′c A,Yu GH.The hyper-Wiener index of trees with give parametres[J].ARS Comb,2010,96:395-404.
Feng LH.The hyper-Wiener index of unicyclic graphs with given matching number[J].ARS Comb,2011,100:9-17.
Feng LH,Liu WJ,Xu KX.The hyper-Wiener index of bicyclic graphs[J].Utilitas Math,2011,84:97-104.
Feng LH,Ili′c A,Zagreb.Harary and hyper-Wiener indices of graphs with a given matching number[J].Applied Math,Letters,2010,23:943-948.
京公网安备11010802024621