On the maximum value of the eccentric distance sums of cubic transitive graphs
From MaRDI portal
Publication:2279418
DOI10.1016/j.amc.2019.04.022zbMath1428.05090OpenAlexW2944145051WikidataQ127886381 ScholiaQ127886381MaRDI QIDQ2279418
Publication date: 12 December 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.04.022
Related Items
Unnamed Item ⋮ 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 ⋮ General eccentric distance sum of graphs
Cites Work
- On the extreme eccentric distance sum of graphs with some given parameters
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- On the eccentric distance sum of graphs
- On the eccentric distance sum of trees and unicyclic graphs
- Further results on the eccentric distance sum
- Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- On a novel eccentricity-based invariant of a graph
- On two eccentricity-based topological indices of graphs
- Extremal values on the eccentric distance sum of trees
- Computing the eccentric-distance sum for graph operations
- Minimum Average Distance Clique Trees
- On the extremal values of the eccentric distance sum of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item