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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $n\geq k\geq 2$ be two integers and $S$ a subset of $\{0,1,\dots,k-1\}$.The graph $J_{S}(n,k)$ has as vertices the $k$-subsets of the $n$-set$[n]=\{1,\dots,n\}$ and two $k$-subsets $A$ and $B$ are adjacent if $|A\capB|\in S$. In this paper, we use Godsil-McKay switching to prove that for $m\geq0$, $k\geq \max(m+2,3)$ and $S = \{0, 1, ..., m\}$, the graphs $J_S(3k-2m-1,k)$are not determined by spectrum and for $m\geq 2$, $n\geq 4m+2$ and $S =\{0,1,...,m\}$ the graphs $J_{S}(n,2m+1)$ are not determined by spectrum. Wealso report some computational searches for Godsil-McKay switching sets in theunion of classes in the Johnson scheme for $k\leq 5$.

Cospectral mates for the union of some classes in the Johnson association scheme