On eccentric distance sum and minimum degree
From MaRDI portal
Publication:401135
DOI10.1016/j.dam.2014.05.019zbMath1297.05076OpenAlexW1973971885MaRDI QIDQ401135
Vivian Mukungunugwa, Simon Mukwembi
Publication date: 26 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.019
Related Items (11)
On the maximal connective eccentricity index of bipartite graphs with some given parameters ⋮ On the extreme eccentric distance sum of graphs with some given parameters ⋮ Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs ⋮ Comparing eccentricity-based graph invariants ⋮ Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index ⋮ On the extremal total reciprocal edge-eccentricity of trees ⋮ On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum ⋮ Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum ⋮ On eccentric distance sum and degree distance of graphs ⋮ General eccentric distance sum of graphs ⋮ On the minimum eccentric distance sum of bipartite graphs with some given parameters
Cites Work
- On the maximal eccentric distance sums of graphs
- On the eccentric distance sum of graphs
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- On the eccentric distance sum of trees and unicyclic graphs
- Further results on the eccentric distance sum
- Using minimum degree to bound average distance
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Mean distance and minimum degree
- Average distance, minimum degree, and spanning trees
This page was built for publication: On eccentric distance sum and minimum degree
