期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2011
卷号：30
期号：2
出版社：Journal of Theoretical and Applied
摘要：In this paper, we give some theoretical results, for the index WienerW, degree distance DD and the hyper-Wiener index WW of a graphG, according to d_G (k)(The number of pairs of vertices of G that are at distance), and the diameter of G. We accomplish this by firstly, giving another proof of the inequality for the planar graphs with nvertices:W(En)≤W(Cn)≤W(Pn)[6], with E_n is a maximal planar graphC_n is a planar graph and P_n is a path planar graph. Secondly, we will apply the theoretical results for some graphs with diameter equals two, as Fan planar graphF_n, Wheel planar graph W_n, maximal planar graph E_n and the butterfly planar graph B_n, and some particularly graphs with diameter greater than two, as the cycle planar graphC_n and the Sunflower planar graph S_n
关键词：Graph; Index Hyper-Wiener; Index Wiener; Index Degree Distance; Index First Zagreb
