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

The eccentricity of a vertex is the maximum distance from it to anothervertex and the average eccentricity $ecc (G)$ of a graph $G$ is the mean valueof eccentricities of all vertices of $G$. The average eccentricity is deeplyconnected with a topological descriptor called the eccentric connectivityindex, defined as a sum of products of vertex degrees and eccentricities. Inthis paper we analyze extremal properties of the average eccentricity,introducing two graph transformations that increase or decrease $ecc (G)$.Furthermore, we resolve four conjectures, obtained by the system AutoGraphiX,about the average eccentricity and other graph parameters (the clique number,the Randi\' c index and the independence number), refute one AutoGraphiXconjecture about the average eccentricity and the minimum vertex degree andcorrect one AutoGraphiX conjecture about the domination number.

On the extremal properties of the average eccentricity