给定最大度的树的Wiener指数的排序.pdfVIP

中国科技论文在线 On the Wiener Index of Trees with Maximum Degree ** LI Jing, WEI Fuyi (College of Science, South China Agricultural University, GuangZhou 510642) 5 Abstract: The Wiener index of a graph is the sum of distances between all unordered pairs of vertices of the graph. In this paper, the fourth and fifth smallest Wiener indices of all trees with maximum degree are determined. Moreover, partial extreme graphs which reach the above lower bounds are also given. Keywords: Graph theory; Wiener index; Maximum degree 10 0 Introduction Throughout this paper we assume that graph G is connected. The vertex set and edge set of graph G are denoted by V( G) and E (G ) , respectively. For every u,v ∈V (G) , the distance dG (u, v) (or simply d (u, v) ) between the vertices u and v of graph G is equal to 15 the length of the shortest path that connects u and v . Let γ(G, k) denote the number of unordered vertex pairs of G , the distance of which is equal to k . The degree of a vertex v in a graph G , denoted by deg v , is the number of edges of G incident with v . And the ( ) maximum degree of the the vertices of