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 Plus

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

Zendy Tools

Zendy Open

A graph $G$ on $m$ vertices is pancyclic if it contains cycles of length $l$,$3\leq l \leq m$ as subgraphs in $G$. The complete graph $K_{9}$ on 9 verticeswith a cycle $C_{9}$ of length 9 deleted from $K_{9}$ is denoted by$(K_{9}-C_{9})$. In this paper, we prove that $(K_{9}-C_{9})^{n}$, theCartesian product of $(K_{9}-C_{9})$ taken $n$ times, is pancyclic.

Pancyclicity in the Cartesian Product $(K_9-C_9 )^n$