General eccentric distance sum of graphs with given diameter
From MaRDI portal
(Redirected from Publication:6650318)
Cites work
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- Computing the eccentric-distance sum for graph operations
- Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
- Eccentric distance sum of Sierpiński gasket and Sierpiński network
- Extremal values on the eccentric distance sum of trees
- General eccentric connectivity index of trees and unicyclic graphs
- General eccentric distance sum of graphs
- Graph products and eccentric harmonic index
- scientific article; zbMATH DE number 6704595 (Why is no real title available?)
- Multiplicative version of eccentric connectivity index
- On extremal bipartite graphs with given number of cut edges
- On the difference between the eccentric connectivity index and eccentric distance sum of graphs
- On the eccentric distance sum of graphs
- On the eccentric distance sum of trees and unicyclic graphs
- On the extreme eccentric distance sum of graphs with some given parameters
- On the maximum value of the eccentric distance sums of cubic transitive graphs
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- Some further results on the eccentric distance sum
- The eccentric distance sum of connected graphs
- The eccentric-distance sum of some graphs
- The minimum eccentric distance sum of trees with given distance k-domination number
- The second-minimum Wiener index of cacti with given cycles
- Wiener index and Steiner 3-Wiener index of graphs
This page was built for publication: General eccentric distance sum of graphs with given diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650318)
