On the Adjacent Eccentric Distance Sum Index of Graphs |
| |
Authors: | Hui Qu Shujuan Cao |
| |
Affiliation: | 1. Department of Mathematics, Shandong Institute of Business and Technology, Yantai, Shandong, China.; 2. School of Mathematical Sciences, Nankai University, Tianjin, China.; Mathematical Institute, HUNGARY, |
| |
Abstract: | For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as , where is the sum of all distances from the vertex v. In this paper we derive some bounds for the adjacent eccentric distance sum index in terms of some graph parameters, such as independence number, covering number, vertex connectivity, chromatic number, diameter and some other graph topological indices. |
| |
Keywords: | |
|
|