
arXiv: 2106.10367
Let $b(k,\ell,θ)$ be the maximum number of vertices of valency $k$ in a $(k,\ell)$-semiregular bipartite graph with second largest eigenvalue $θ$. We obtain an upper bound for $b(k,\ell,θ)$ for $0 < θ< \sqrt{k-1} + \sqrt{\ell-1}$. This bound is tight when there exists a distance-biregular graph with particular parameters, and we develop the necessary properties of distance-biregular graphs to prove this.
25 pages
Extremal problems in graph theory, spectral Moore bound, Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), semiregular bipartite graph, Linear programming, distance-biregular graph, FOS: Mathematics, Association schemes, strongly regular graphs, Mathematics - Combinatorics, second eigenvalue, Combinatorics (math.CO)
Extremal problems in graph theory, spectral Moore bound, Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), semiregular bipartite graph, Linear programming, distance-biregular graph, FOS: Mathematics, Association schemes, strongly regular graphs, Mathematics - Combinatorics, second eigenvalue, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
