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

Let $n$, $k$ and $l$ be integers with $1\leq k<l\leq n-1$. The set-inclusiongraph $G(n,k,l)$ is the graph whose vertex set consists of all $k$- and$l$-subsets of $[n]=\{1,2,\ldots,n\}$, where two distinct vertices are adjacentif one of them is contained in another. In this paper, we determine thespectrum and automorphism group of $G(n,k,l)$, respectively.

The spectrum and automorphism group of the set-inclusion graph