English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let G = (V,E) be a simple connected graph. The eccentric-distance sum of G is defined as ξ(G) = ∑ u∈V (G) e(u)D(u) where e(u) is the eccentricity of the vertex u in G and D(u) is the sum of distances between u and all other vertices of G. In this paper, we establish formulae to calculate the eccentric-distance sum for some cycle related graphs, namely Cn, complement of Cn, shadow of Cn and the line graph of Cn. Also, it is shown that, the eccentric-distance sum of Cn is less than the eccentric-distance sum of shadow of Cn for all n ≥ 3.

The Eccentric-Distance Sum of Cycles and Related Graphs