Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Generalization of Brown's Construction for the Degree/Diameter Problem   The degree/diameter problem is the problem of finding the largest possible
number of vertices $n_{\Delta,D}$ in a graph of given degree $\Delta$ and
diameter $D$. We consider the problem for the case of diameter $D=2$. William G
Brown gave a lower bound of the order of $(\Delta,2)$-graph. In this paper, we
give a generalization of his construction and improve the lower bounds for the
case of $\Delta=306$ and $\Delta=307$. One is $(306,2)$-graph with $88723$
vertices, the other is $(307,2)$-graph with $88724$ vertices.

26
The categories of this paper are: bayes-an
20
The categories of this paper are: acc-phys
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th
1
The categories of this paper are: cs
10
The categories of this paper are: q-bio