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.054zbMath1222.05039OpenAlexW2048161246MaRDI QIDQ549771
Shu Wen, Kexiang Xu, Hong-Bo 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
Related Items (16)
On eccentric distance sum and minimum degree ⋮ Comparing eccentricity-based graph invariants ⋮ Unnamed Item ⋮ On the eccentric distance sum of trees with given maximum degree ⋮ Extremal values on the eccentric distance sum of trees ⋮ Computing the eccentric-distance sum for graph operations ⋮ On the extremal values of the eccentric distance sum of trees ⋮ Inverse Connective Eccentricity Index and its Applications ⋮ 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 domination number ⋮ Some further results on the eccentric distance sum ⋮ On eccentric distance sum and degree distance of graphs ⋮ Further results on the eccentric distance sum ⋮ On the extremal values of the eccentric distance sum of trees with a given maximum degree ⋮ The eccentric-distance sum of some graphs ⋮ General eccentric distance sum of graphs
Cites Work
This page was built for publication: A short and unified proof of Yu et al.'s two results on the eccentric distance sum