On the maximal eccentric distance sums of graphs (Q420191): Difference between revisions

Summary: If \(G\) is a simple connected graph with vertex \(V(G)\), then the eccentric distance sum of \(G\), denoted by \(\xi^d(G)\), is defined as \(\sum_{v\in V(G)} \text{ec}_G(v) D_G(v)\), where \(\text{ec}_G(v)\) is the eccentricity of the vertex \(v\) and \(D_G(v)\) is the sum of all distances from the vertex \(v\). Let \(n \geq 8\). We determine the \(n\)-vertex trees with, respectively, the maximum, second-maximum, third-maximum, and fourth-maximum eccentric distance sums. We also characterize the extremal unicyclic graphs on \(n\) vertices with respectively, the maximal, second maximal, and third maximal eccentric distance sums.