On the Adjacent Eccentric Distance Sum Index of Graphs.
Where this comes from
- Record sourced from PubMed, PMID 26091095.
- Also identified by DOI 10.1371/journal.pone.0129497 and PMC identifier 4474630.
- Licence recorded as CC BY.
- The licence permits redistribution, so the abstract is shown in full and the full text is available from the publisher.
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.
Medical subject headings
- Models, Theoretical