Back to Search
Start Over
General eccentric distance sum of graphs.
- Source :
- Discrete Mathematics, Algorithms & Applications; Aug2021, Vol. 13 Issue 4, pN.PAG-N.PAG, 17p
- Publication Year :
- 2021
-
Abstract
- For a , b ∈ ℝ , we define the general eccentric distance sum of a connected graph G as EDS a , b (G) = ∑ v ∈ V (G) (e c c G (v)) a (D G (v)) b , where V (G) is the vertex set of G , e c c G (v) is the eccentricity of a vertex v in G , D G (v) = ∑ w ∈ V (G) d G (v , w) and d G (v , w) is the distance between vertices v and w in G. This index generalizes several other indices of graphs. We present some bounds on the general eccentric distance sum for general graphs, bipartite graphs and trees of given order, graphs of given order and vertex connectivity and graphs of given order and number of pendant vertices. The extremal graphs are presented as well. [ABSTRACT FROM AUTHOR]
- Subjects :
- GRAPH connectivity
TREE graphs
BIPARTITE graphs
DISTANCES
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 13
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 151347485
- Full Text :
- https://doi.org/10.1142/S1793830921500464