Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
From MaRDI portal
Publication:1671325
DOI10.1016/J.DAM.2018.03.057zbMath1394.05023OpenAlexW2797552901MaRDI QIDQ1671325
Yueyu Wu, Shuya Chen, Lingli Sun, Shuchao Li
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.057
Related Items (5)
On the eccentric distance sum of trees with given maximum degree ⋮ On the difference between the eccentric connectivity index and eccentric distance sum of graphs ⋮ Extremal trees of given segment sequence with respect to some eccentricity-based invariants ⋮ On the extremal values of the eccentric distance sum of trees with a given maximum degree ⋮ The minimum eccentric distance sum of trees with given distance k-domination number
Cites Work
- Unnamed Item
- On the extreme eccentric distance sum of graphs with some given parameters
- On eccentric distance sum and minimum degree
- On the eccentric distance sum of graphs
- On the eccentric distance sum of trees and unicyclic graphs
- Further results on the eccentric distance sum
- Maximizing the spectral radius of \(k\)-connected graphs with given diameter
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- On the extremal values of the eccentric distance sum of trees with a given domination number
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- Connectivity, diameter, independence number and the distance spectral radius of graphs
- Extremal values on the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees
This page was built for publication: Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
