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/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

In a uniform central graph (UCG) the eccentric verticies of a central vertex is the same for all central verticies. This collection of eccentric verticies is the centered periphery. For a pair of graphs $(C, P)$ the central-peripheral appendage number, $A_{ucg}(C, P)$, is the minimum number verticies needed to be adjoined to the graphs $C$ and $P$ in order to construct a uniform central graph H with center C and centered-periphery P. We compute $A_{ucg}(C, P)$ in terms of the radius and diameter of P and whether or not $C$ is a complete graph. In the process we show $A_{ucg}(C, P)\leq 6$ if $diam(P) > 2$. We also provide structure theorems for UCGs in terms of the centered periphery.

On central-peripheral appendage numbers of uniform central graphs