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

This paper proves the existence of $t$-identifying codes on the class ofundirected de Bruijn graphs with string length $n$ and alphabet size $d$,referred to as $\mathcal{B}(d,n)$. It is shown that $\mathcal{B}(d,n)$ is$t$-identifiable whenever $d \geq 3$ and $n \geq 2t$, and $t \geq 1$. We alsoshow that $\mathcal{B}(d,n)$ is $t$-identifiable if either $d \geq 3$, $n \geq3$, and $t=2$, or if $d = 2$, $n \geq 3$, and $t=1$. The remaining cases remainopen. Additionally, we show that the eccentricity of the undirected non-binaryde Bruijn graph is $n$.

On the Existence of $t$-Identifying Codes in Undirected De Bruijn Graphs