On the Adjacent Eccentric Distance Sum Index of Graphs.
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2015-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC4474630?pdf=render |
| id |
doaj-637902a2411d47a8bf639fc519c5d313 |
|---|---|
| record_format |
Article |
| spelling |
doaj-637902a2411d47a8bf639fc519c5d3132020-11-25T01:18:46ZengPublic Library of Science (PLoS)PLoS ONE1932-62032015-01-01106e012949710.1371/journal.pone.0129497On the Adjacent Eccentric Distance Sum Index of Graphs.Hui QuShujuan CaoFor 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.http://europepmc.org/articles/PMC4474630?pdf=render |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Hui Qu Shujuan Cao |
| spellingShingle |
Hui Qu Shujuan Cao On the Adjacent Eccentric Distance Sum Index of Graphs. PLoS ONE |
| author_facet |
Hui Qu Shujuan Cao |
| author_sort |
Hui Qu |
| title |
On the Adjacent Eccentric Distance Sum Index of Graphs. |
| title_short |
On the Adjacent Eccentric Distance Sum Index of Graphs. |
| title_full |
On the Adjacent Eccentric Distance Sum Index of Graphs. |
| title_fullStr |
On the Adjacent Eccentric Distance Sum Index of Graphs. |
| title_full_unstemmed |
On the Adjacent Eccentric Distance Sum Index of Graphs. |
| title_sort |
on the adjacent eccentric distance sum index of graphs. |
| publisher |
Public Library of Science (PLoS) |
| series |
PLoS ONE |
| issn |
1932-6203 |
| publishDate |
2015-01-01 |
| description |
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. |
| url |
http://europepmc.org/articles/PMC4474630?pdf=render |
| work_keys_str_mv |
AT huiqu ontheadjacenteccentricdistancesumindexofgraphs AT shujuancao ontheadjacenteccentricdistancesumindexofgraphs |
| _version_ |
1725140572888367104 |