Related Experiment Video
Updated: Apr 9, 2026

Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients
Published on: December 18, 2016
On the Adjacent Eccentric Distance Sum Index of Graphs
1Department of Mathematics, Shandong Institute of Business and Technology, Yantai, Shandong, China.
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 [Formula in text], where [Formula in text] 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.
Related Concept Videos
General Case of Eccentric Axial Loading
Consider a member subjected to equal and opposite forces that are applied along a line that does not coincide with the member's neutral axis. In unsymmetrical...
Eccentricity of an Ellipse
Graphical Representation of Inequalities
Graphs of Equations in Two Variables
Graphs of Polar Equations
Graphs of Functions

