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 $b(k,\theta)$ be the maximum order of a connected bipartite $k$-regular graph whose second largest eigenvalue is at most $\theta$. In this paper, we obtain a general upper bound for $b(k,\theta)$ for any $0\leq \theta< 2\sqrt{k-1}$. Our bound gives the exact value of $b(k,\theta)$ whenever there exists a bipartite distance-regular graph of degree $k$, second largest eigenvalue $\theta$, diameter $d$ and girth $g$ such that $g\geq 2d-2$. For certain values of $d$, there are infinitely many such graphs of various valencies $k$. However, for $d=11$ or $d\geq 15$, we prove that there are no bipartite distance-regular graphs with $g\geq 2d-2$.

A spectral version of the Moore problem for bipartite regular graphs