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

Many real world networks (graphs) are observed to be 'small worlds', i.e.,the average path length among nodes is small. On the other hand, it is somewhatunclear what other average path length values networks can produce. Inparticular, it is not known what the maximum and the minimum average pathlength values are. In this paper we provide a lower estimation for the shortestaverage path length (l) values in connected networks, and the largest possibleaverage path length values in networks with given size and density. To thelatter end, we construct a special family of graphs and calculate their averagepath lengths. We also demonstrate the correctness of our estimation bysimulations.

An Estimation of the Shortest and Largest Average Path Length in Graphs of Given Density