Further results on the eccentric distance sum

Authors:
Hongbo Hua;Shenggui Zhang;Kexiang Xu
Affiliations:
Faculty of Mathematics and Physics, Huaiyin Institute of Technology, Huai'an, Jiangsu 223003, PR China and Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi ...;Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072, PR China;College of Science, Nanjing University of Aeronautics & Astronautic, Nanjing, Jiangsu 210016, PR China
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 3
Cited 2

Eigen values and expanders

Combinatorica
Graph Theory With Applications

Graph Theory With Applications
The eccentric connectivity index of nanotubes and nanotori

Journal of Computational and Applied Mathematics

Extremal values on the eccentric distance sum of trees

Discrete Applied Mathematics
Computing the eccentric-distance sum for graph operations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

The eccentric distance sum (EDS) is a novel graph invariant which can be used to predict biological and physical properties, and has a vast potential in structure activity/property relationships. For a connected graph G, its EDS is defined as @x^d(G)=@?"v"@?"V"("G")ecc"G(v)D"G(v), where ecc"G(v) is the eccentricity of a vertex v in G and D"G(v) is the sum of distances of all vertices in G from v. In this paper, we obtain some further results on EDS. We first give some new lower and upper bounds for EDS in terms of other graph invariants. Then we present two Nordhaus-Gaddum-type results for EDS. Moreover, for a given nontrivial connected graph, we give explicit formulae for EDS of its double graph and extended double cover, respectively. Finally, for all possible k values, we characterize the graphs with the minimum EDS within all connected graphs on n vertices with k cut edges and all graphs on n vertices with edge-connectivity k, respectively.