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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Many real networks share three generic properties: they are scale-free,display a small-world effect, and show a power-law strength-degree correlation.In this paper, we propose a type of deterministically growing networks calledSierpinski networks, which are induced by the famous Sierpinski fractals andconstructed in a simple iterative way. We derive analytical expressions fordegree distribution, strength distribution, clustering coefficient, andstrength-degree correlation, which agree well with the characterizations ofvarious real-life networks. Moreover, we show that the introduced Sierpinskinetworks are maximal planar graphs.

Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation