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

Kok et.al. [3] introduced Jaco Graphs \emph{(order 1)}. It is hoped that as aspecial case, a closed formula can be found for the number of edges of a finiteJaco Graph $J_n(1)$. However, the algorithms discussed in Ahlbach et.al. [1]suggest this might not be possible. Finding a closed formula for the number ofedges of a Jaco Graph $J_n(1), n \in \Bbb N$ remains an interesting openproblem. In this note we present three alternative, \emph{formula}.

A note on the number of edges of the Jaco Graph, $J_n(1), n \in \Bbb N