期刊论文

Li, Shuchao

英文

Journal of Mathematical Analysis and Applications

0022-247X

2012

390

1

99-112

10.1016/j.jmaa.2012.01.022

National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [11071096, 11101245]; Natural Science Foundation of ShandongNatural Science Foundation of Shandong Province [RZ2011AQ005, BS2010SF017]; Special Fund for Basic Scientific Research of Central Colleges [CCNU11A02015]

本校为第一且通讯机构

Let G = (V-G, E-G) be a simple connected graph. The eccentric distance sum of G is defined as xi(d)(G) = Sigma(v is an element of VG) epsilon(G)(V)D-G(v) where epsilon(G)(V) is the eccentricity of the vertex v and D-G (v) = Sigma(u is an element of VG) d(u, v) is the sum of all distances from the vertex v. In this paper we first characterize the extremal trees among n-vertex conjugated trees (trees with a perfect matching) having the minimal and second minimal eccentric distance sums. Then we identify the trees with the minimal and second minimal eccentric distance sums among the n-vertex tree...