A short and unified proof of Yu et al.'s two results on the eccentric distance sum
From MaRDI portal
Publication:549771
DOI10.1016/J.JMAA.2011.04.054zbMATH Open1222.05039OpenAlexW2048161246MaRDI QIDQ549771FDOQ549771
Authors: Kexiang Xu, Shu Wen, Hongbo Hua
Publication date: 18 July 2011
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.04.054
Recommendations
Cites Work
Cited In (18)
- On eccentric distance sum and degree distance of graphs
- On eccentric distance sum and minimum degree
- General eccentric distance sum of graphs
- The eccentric-distance sum of some graphs
- On the extremal values of the eccentric distance sum of trees
- Further results on the eccentric distance sum
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal values on the eccentric distance sum of trees
- On the eccentric distance sum of trees with given maximum degree
- Computing the eccentric-distance sum for graph operations
- Comparing eccentricity-based graph invariants
- On the extremal values of the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees with a given maximum degree
- General eccentric distance sum of graphs with given diameter
- Some further results on the eccentric distance sum
- On the extremal values of the eccentric distance sum of trees with a given domination number
- Inverse Connective Eccentricity Index and its Applications
This page was built for publication: A short and unified proof of Yu et al.'s two results on the eccentric distance sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549771)