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 discriminant power of centrality indices for the degree, eigenvector,closeness, betweenness and subgraph centrality is analyzed. It is defined bythe number of graphs for which the standard deviation of the centrality of itsnodes is zero. On the basis of empirical analysis it is concluded that thesubgraph centrality displays better discriminant power than the rest ofcentralities. We also propose some new conjectures about the types of graphsfor which the subgraph centrality does not discriminate among nonequivalentnodes.

About the Discriminant Power of the Subgraph Centrality and Other  Centrality Measures About the Discriminant Power of the Subgraph Centrality  and Other Centrality Measures(Working paper)