In this paper, we obtain a general upper bound for b ( k , θ ) for any 0 ≤ θ < 2 k - 1 . Our bound gives the exact value of b ( k , θ ) whenever there exists a ...

May 2, 2018 · 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) ...

graphs (see [11] for example), our Theorem 4.1 can be interpreted as a spectral version of the Moore problem for bipartite regular graphs. In Section 2, we ...

k − 1. Our bound gives the exact value of b whenever there exists a bipartite distance-regular graph of degree k, second largest eigenvalue θ, ...

Abstract. Let $b(k,\theta)$ be the maximum order of a connected bipartite $k$-regular graph whose second largest eigenvalue is at most $\theta$.

The authors' bound gives the exact value of b(k,\theta) whenever there exists a bipartite distance-regular graph of degree $k$, second largest eigenvalue ...

Dec 13, 2019 · Let r ≥ 3 be an integer and θ be any real number between 0 and 2 √ r − 1. Define b(r, θ) as the maximum number of vertices of a bipartite r- ...

Our bound gives the exact value of b ​ ( k , θ ) b k 𝜃 b(k,\theta) whenever there exists a bipartite distance-regular graph of degree k k k , second largest ...

Cioabă, Sebastian M., Koolen, Jack H., and Nozaki, Hiroshi. A spectral version of the Moore problem for bipartite regular graphs. Retrieved from https://par.nsf ...

The paper "A spectral version of the Moore problem for bipartite regular graphs" with Sebastian Cioabă and Jack Koolen has been published in Algebraic ...