This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

New families of strongly regular graphs

S.G. Barwick, Wen-Ai Jackson and Tim Penttila
Abstract

In this article we construct a series of new infinite families of strongly regular graphs with the same parameters as the point-graphs of non-singular quadrics in PG(n,2){\rm PG}(n,2).

Corresponding Author: Dr Susan Barwick, University of Adelaide, Adelaide 5005, Australia. Phone: +61 8 8313 3983, Fax: +61 8 8313 3696, email: susan.barwick@adelaide.edu.au

Keywords: strongly regular graphs, projective geometry, quadrics

AMS codes: 51E20, 05B25, 05C62

1 Introduction

A strongly regular graph srg(v,k,λ,μ)(v,k,\lambda,\mu), is a graph with vv vertices such that each vertex lies on kk edges; any two adjacent vertices have exactly λ\lambda common neighbours; and any two non-adjacent vertices have exactly μ\mu common neighbours. We consider the strongly regular graphs constructed from a non-singular quadric 𝒬n\mathscr{Q}_{n} in PG(n,q){\rm PG}(n,q). The point-graph Γ𝒬n\Gamma_{\mathscr{Q}_{n}} of 𝒬n\mathscr{Q}_{n} has vertices corresponding to the points of 𝒬n\mathscr{Q}_{n}. Two vertices in Γ𝒬n\Gamma_{\mathscr{Q}_{n}} are adjacent if the corresponding points of 𝒬n\mathscr{Q}_{n} lie on a line contained in 𝒬n\mathscr{Q}_{n}. It is well known (see for example [3]) that Γ𝒬n\Gamma_{\mathscr{Q}_{n}} is a strongly regular graph. In this article we let q=2q=2, and construct from Γ𝒬n\Gamma_{\mathscr{Q}_{n}} approximately n/2n/2 new strongly regular graphs with the same parameters as Γ𝒬n\Gamma_{\mathscr{Q}_{n}} (see Table 3 for a precise count).

This article proceeds as follows. Section 2 contains several preliminary results we need. Section 3 describes our construction of a series of infinite families of strongly regular graphs, the proof of the construction is given in Section 4. In Section 5, we classify and count the maximal cliques in the new graphs. In Section 6 we prove that our construction yields new families of strongly regular graphs. Finally, in Section 7, we determine the automorphism group of the new graphs.

In previous work, Kantor [8] constructed a strongly regular graph from Γ𝒬n\Gamma_{\mathscr{Q}_{n}} with the same parameters in the case when 𝒬n\mathscr{Q}_{n} contains a spread. Kantor conjects that his graph is not isomorphic to Γ𝒬n\Gamma_{\mathscr{Q}_{n}}. We show in Section 6.1 that the graph constructed by Kantor is not isomorphic to any of our new graphs. Abiad and Haemers [1] construct several strongly regular graphs from the symplectic graph over GF(2){\rm GF}(2). The dual of these graphs have the same parameters as the point-graph of a non-singular parabolic quadric, so nn is even. It is not known if these graphs are isomorphic to our examples with nn even.

2 Background Results

In [5], Godsil and McKay take a graph Γ\Gamma, and use a vertex partition to construct a new graph Γ\Gamma^{\prime} that has the same spectrum as Γ\Gamma. It is well-known (see for example [4]) that if a graph Γ\Gamma^{\prime} has the same spectrum as a strongly regular graph Γ\Gamma, then Γ\Gamma^{\prime} is also strongly regular with the same parameters as Γ\Gamma. Specialising the Godsil-McKay construction to a partition of size two in a strongly regular graph gives the following result.

Result 2.1
  1. 1.

    A Godsil-McKay partition of a graph is a partition of the vertices into two sets {𝒳,𝒴}\{\mathcal{X},\mathcal{Y}\} satisfying:

    • I.

      The set 𝒳\mathcal{X} induces a regular subgraph.

    • II.

      Each vertex in 𝒴\mathcal{Y} is adjacent to 0, 12|𝒳|\frac{1}{2}|\mathcal{X}| or |𝒳||\mathcal{X}| vertices in 𝒳\mathcal{X}.

  2. 2.

    Godsil-McKay construction. Let Γ\Gamma be a strongly regular graph with Godsil-McKay partition {𝒳,𝒴}\{\mathcal{X},\mathcal{Y}\}. Construct the graph Γ\Gamma^{\prime} with the same points and edges as Γ\Gamma, except: for each vertex RR in 𝒴\mathcal{Y} with 12|𝒳|\frac{1}{2}|\mathcal{X}| neighbours in 𝒳\mathcal{X}, delete these 12|𝒳|\frac{1}{2}|\mathcal{X}| edges and join RR to the other 12|𝒳|\frac{1}{2}|\mathcal{X}| vertices in 𝒳\mathcal{X}. Then the graph Γ\Gamma^{\prime} is strongly regular with the same parameters as Γ\Gamma.

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,q){\rm PG}(n,q). The projective index gg of 𝒬n\mathscr{Q}_{n} is the dimension of the largest subspace contained in 𝒬n\mathscr{Q}_{n}. A gg-space contained in 𝒬n\mathscr{Q}_{n} is called a generator of 𝒬n\mathscr{Q}_{n}. If n=2rn=2r is even, then a non-singular quadric is called a parabolic quadric, denoted 𝒫2r\mathcal{P}_{2r}, which has projective index g=r1g=r-1. If n=2r+1n=2r+1 is odd, then there are two types of non-singular quadrics: the elliptic quadric denoted 2r+1{\cal E}_{2r+1} has projective index g=r1g=r-1; and the hyperbolic quadric denoted 2r+1\mathcal{H}_{2r+1} has projective index g=rg=r. The points and generators of 𝒬n\mathscr{Q}_{n} also form a polar space of rank g+1g+1. We repeatedly use the following two properties of quadrics and polar spaces, see [7, Chapter 22] for more information on quadrics, and [7, Section 26.1] for more information on polar spaces.

Result 2.2

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,q){\rm PG}(n,q) and let Π\Pi be a kk-space. If the quadric 𝒬nΠ\mathscr{Q}_{n}\cap\Pi contains a (k1)(k-1)-space, then 𝒬nΠ\mathscr{Q}_{n}\cap\Pi is either Π\Pi, or one or two (k1)(k-1)-spaces.

Result 2.3

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2), with projective index gg. Let Σ\Sigma be a generator of 𝒬n\mathscr{Q}_{n}, and XX a point of 𝒬n\mathscr{Q}_{n} not in Σ\Sigma. Then there is a unique generator Π\Pi of 𝒬n\mathscr{Q}_{n} that contains XX and meets Σ\Sigma in a (g1)(g-1)-space. Further, the points in Σ\Sigma which lie on a line of 𝒬n\mathscr{Q}_{n} through XX are exactly the points in ΣΠ\Sigma\cap\Pi.

3 Our construction

We begin with a small example to illustrate the general construction.

Example 3.1

Let \ell be a line of the elliptic quadric =2r+1{\cal E}={\cal E}_{2r+1} in PG(2r+1,q){\rm PG}(2r+1,q). Partition the points of {\cal E} into the following three types.

  • (i)

    points of {\cal E} on \ell,

  • (ii)

    points of {\cal E} that are on a plane of {\cal E} that contains \ell,

  • (iii)

    the remaining points of {\cal E}.

Define a new graph Γ1\Gamma_{1} with vertices the points of {\cal E}, and edges given in Table 1.

Table 1: Edges in Γ1\Gamma_{1}
Vertex pair Vertex types Vertex pair is an edge of Γ1\Gamma_{1}:
P,PP,P^{\prime} P,PP,P^{\prime} are type (i) always (as PPPP^{\prime} is always a line of {\cal E})
P,QP,Q PP is type (i), QQ is type (ii) always (as PQPQ is always a line of {\cal E})
Q,QQ,Q^{\prime} Q,QQ,Q^{\prime} are type (ii) when QQQQ^{\prime} is a line of {\cal E}
P,RP,R PP is type (i), RR is type (iii) when PRPR is a line of {\cal E}
R,RR,R^{\prime} R,RR,R^{\prime} are type (iii) when RRRR^{\prime} is a line of {\cal E}
Q,RQ,R QQ is type (ii), RR is type (iii) when QRQR is a 22-secant of {\cal E}

Note that the last row of Table 1 describes the edges of Γ1\Gamma_{1} that are different to the edges of the point-graph Γ\Gamma_{\cal E} of {\cal E}.

It can be shown directly using geometric techniques that Γ1\Gamma_{1} is regular if and only if q=2q=2, and that in this case Γ1\Gamma_{1} is strongly regular with the same parameters as Γ\Gamma_{\cal E}. This can also be proved using the Godsil-McKay construction as follows. Consider the partition {𝒳,𝒴}\{\mathcal{X},\mathcal{Y}\} of Γ\Gamma_{\cal E} where 𝒳\mathcal{X} contains the vertices of type (ii), and 𝒴\mathcal{Y} contains the vertices of type (i) and (iii). Geometric techniques can be used to show that this partition satisfies the conditions of Result 2.1(1) if and only if q=2q=2. Note that the graph constructed in Result 2.1(2) from this partition is the graph Γ1\Gamma_{1}, hence Γ1\Gamma_{1} is strongly regular when q=2q=2. \square

We now give our general construction of a series of infinite families of strongly regular graphs. This construction generalises Example 3.1. First we define a partition of the vertices of the point-graph of 𝒬n\mathscr{Q}_{n}.

Definition 3.2

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,q){\rm PG}(n,q), and let Γ\Gamma be the point-graph of 𝒬n\mathscr{Q}_{n}. Let ss be an integer with 0s<g0\leq s<g, where gg is the projective index of 𝒬n\mathscr{Q}_{n}. Let αs\alpha_{s} be an ss-dimensional subspace contained in 𝒬n{\mathscr{Q}_{n}}. The points of 𝒬n\mathscr{Q}_{n} (and so the vertices of Γ\Gamma) can be partitioned into three types:

  • (i)

    points in αs\alpha_{s},

  • (ii)

    points of 𝒬n\αs\mathscr{Q}_{n}\backslash\alpha_{s} that lie in some (s+1)(s+1)-dimensional subspace Π\Pi with αsΠ𝒬n\alpha_{s}\subset\Pi\subset\mathscr{Q}_{n},

  • (iii)

    the remaining points of 𝒬n\mathscr{Q}_{n}.

Let 𝒳s\mathcal{X}_{s} be the vertices of Γ\Gamma of type (ii) and let 𝒴s\mathcal{Y}_{s} be the vertices of Γ\Gamma of type (i) and (iii).

Note that if s=gs=g, then there are no points of type (ii), so we need s<gs<g. We will show that the partition {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\}, 0s<g0\leq s<g, is a Godsil-McKay partition if and only if q=2q=2. By [7, Theorem 26.6.6], the group fixing 𝒬n\mathscr{Q}_{n} is transitive on the subspaces of dimension ss contained in 𝒬n\mathscr{Q}_{n}. So for each ss, 0s<g0\leq s<g, we can use Result 2.1 to construct a unique strongly regular graph Γs\Gamma_{s} from Γ\Gamma. We state the main result here, and give the proof in Section 4.

Theorem 3.3

In PG(n,2){\rm PG}(n,2), let 𝒬n\mathscr{Q}_{n} be a non-singular quadric of projective index g1g\geq 1 with point-graph Γ\Gamma. For each integer ss, 0s<g0\leq s<g, let Γs\Gamma_{s} be the graph obtained using the Godsil-McKay construction with the partition {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} defined in Definition 3.2. Then Γs\Gamma_{s} is a strongly regular graph with the same parameters as Γ\Gamma.

We show in Section 6 that Γ0Γ\Gamma_{0}\cong\Gamma, and that for each nn, Γs\Gamma_{s}, 0s<g0\leq s<g are g1g-1 non-isomorphic graphs.

4 Proof of Theorem 3.3

Throughout this section, let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,q){\rm PG}(n,q) of projective index gg, and let αs\alpha_{s} be a subspace of dimension ss, 0s<g0\leq s<g, contained in 𝒬n\mathscr{Q}_{n}. Let Γ\Gamma be the point-graph of 𝒬n\mathscr{Q}_{n}, and let {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} be the partition of the vertices of Γ\Gamma (and so of the points of 𝒬n\mathscr{Q}_{n}) defined in Definition 3.2. We will show that {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} satisfies Conditions I and II of Result 2.1. First we count the points in 𝒳s\mathcal{X}_{s}.

Lemma 4.1
  1. 1.

    If 𝒬n=2r+1\mathscr{Q}_{n}={\cal E}_{2r+1}, then |𝒳s|=qs+1(qrs+1)(qrs11)(q1)|\mathcal{X}_{s}|=\displaystyle\frac{q^{s+1}(q^{r-s}+1)(q^{r-s-1}-1)}{(q-1)}.

  2. 2.

    If 𝒬n=2r+1\mathscr{Q}_{n}=\mathcal{H}_{2r+1}, then |𝒳s|=qs+1(qrs1+1)(qrs1)(q1)|\mathcal{X}_{s}|=\displaystyle\frac{q^{s+1}(q^{r-s-1}+1)(q^{r-s}-1)}{(q-1)}.

  3. 3.

    If 𝒬n=𝒫2r\mathscr{Q}_{n}=\mathcal{P}_{2r}, then |𝒳s|=qs+1(qrs1+1)(qrs11)(q1)|\mathcal{X}_{s}|=\displaystyle\frac{q^{s+1}(q^{r-s-1}+1)(q^{r-s-1}-1)}{(q-1)}.

Proof  We prove this in the case 𝒬n\mathscr{Q}_{n} is =2r+1{\cal E}={\cal E}_{2r+1}, which has projective index g=r1g=r-1 and point-graph denoted Γ\Gamma_{\cal E}. The cases when 𝒬n\mathscr{Q}_{n} is 2r+1\mathcal{H}_{2r+1} and 𝒫2r\mathcal{P}_{2r} are proved in a very similar manner.

By [7, Theorem 22.5.1], the number of subspaces of dimension ss contained in {\cal E} is

((qrs+1+1)(qrs+2+1)(qr+1+1))×((qrs1)(qrs+11)(qr1))(q1)(q21)(qs+11).\frac{\Big{(}(q^{r-s+1}+1)(q^{r-s+2}+1)\cdots(q^{r+1}+1)\Big{)}\times\Big{(}(q^{r-s}-1)(q^{r-s+1}-1)\cdots(q^{r}-1)\Big{)}}{(q-1)(q^{2}-1)\cdots(q^{s+1}-1)}.

Moreover, replacing ‘ss’ by ‘s+1s+1’ in this equation gives the number of subspaces of dimension s+1s+1 contained in {\cal E}. By [6, Theorem 3.1], the number of subspaces of dimension ss in a subspace of dimension s+1s+1 is (qs+21)/(q1)\big{(}q^{s+2}-1\big{)}/\big{(}q-1\big{)}. By [7], the number of subspaces of dimension s+1s+1 that contain αs\alpha_{s} and are contained in {\cal E} is a constant. To calculate it, we count ordered pairs (Π,Σ)(\Pi,\Sigma) where Π\Pi is an ss-dimensional subspace contained in {\cal E}, Σ\Sigma is an (s+1)(s+1)-dimensional subspace contained in {\cal E}, and ΠΣ\Pi\subset\Sigma. This count gives the number of subspaces of dimension s+1s+1 that contain αs\alpha_{s} and are contained in {\cal E} is

x=(qrs+1)(qrs11)(q1).x=\frac{(q^{r-s}+1)(q^{r-s-1}-1)}{(q-1)}. (1)

Each of these subspace contains qs+1q^{s+1} points that are not in αs\alpha_{s}. Hence |𝒳s|=xqs+1|\mathcal{X}_{s}|=xq^{s+1} as required. \square

We now show that {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} satisfies Condition I of Result 2.1.

Lemma 4.2

Let Γ\Gamma^{*} be the subgraph of Γ\Gamma on the vertices in 𝒳s\mathcal{X}_{s}. Then Γ\Gamma^{*} is a regular graph with degree kk where:

  1. 1.

    if 𝒬n=2r+1\mathscr{Q}_{n}={\cal E}_{2r+1}, then k=(qs+11)+qs+2(qrs1+1)(qrs21)(q1)\displaystyle k=(q^{s+1}-1)+\frac{q^{s+2}(q^{r-s-1}+1)(q^{r-s-2}-1)}{(q-1)};

  2. 2.

    if 𝒬n=2r+1\mathscr{Q}_{n}=\mathcal{H}_{2r+1}, then k=(qs+11)+qs+2(qrs2+1)(qrs11)(q1)\displaystyle k=(q^{s+1}-1)+\frac{q^{s+2}(q^{r-s-2}+1)(q^{r-s-1}-1)}{(q-1)};

  3. 3.

    if 𝒬n=𝒫2r\mathscr{Q}_{n}=\mathcal{P}_{2r}, then k=(qs+11)+qs+2(qrs2+1)(qrs21)(q1).\displaystyle k=(q^{s+1}-1)+\frac{q^{s+2}(q^{r-s-2}+1)(q^{r-s-2}-1)}{(q-1)}.

Proof  We prove this in the case 𝒬n\mathscr{Q}_{n} is =2r+1{\cal E}={\cal E}_{2r+1}, which has projective index g=r1g=r-1 and point-graph denoted Γ\Gamma_{\cal E}. The cases when 𝒬n\mathscr{Q}_{n} is 2r+1\mathcal{H}_{2r+1} and 𝒫2r\mathcal{P}_{2r} are proved in a very similar manner.

Let QQ be a vertex in 𝒳s\mathcal{X}_{s}, we need to count the number of vertices in 𝒳s\mathcal{X}_{s} that are adjacent to QQ. Recall that 𝒳s\mathcal{X}_{s} consists of vertices of type (ii), so in PG(2r+1,q){\rm PG}(2r+1,q), QQ is a point of the quadric {\cal E}, and the (s+1)(s+1)-dimensional space Σ=Q,αs\Sigma=\langle Q,\alpha_{s}\rangle is contained in {\cal E}. A vertex QQ^{\prime} in 𝒳s\mathcal{X}_{s} is adjacent to QQ if the line QQQQ^{\prime} is contained in {\cal E}. We partition the lines of {\cal E} through QQ into three families: 1{\cal F}_{1} contains the lines of {\cal E} through QQ that lie in Σ\Sigma; 2{\cal F}_{2} contains the lines of {\cal E} through QQ (not in 1{\cal F}_{1}) that lie in an (s+2)(s+2)-dimensional subspace that contains Σ\Sigma and is contained in {\cal E}; and 3{\cal F}_{3} contains the remaining lines of {\cal E} through QQ.

We first look at 1{\cal F}_{1}. The number of lines in 1{\cal F}_{1} equals the number of lines through a point in an (s+1)(s+1)-dimensional subspace, so by [6, Theorem 3.1],

|1|=(qs+11)(q1).|{\cal F}_{1}|=\frac{(q^{s+1}-1)}{(q-1)}. (2)

Each of the lines in 1{\cal F}_{1} contains the point QQ and meets αs\alpha_{s} in one point. So each line in 1{\cal F}_{1} gives rise to q1q-1 vertices in 𝒳s\mathcal{X}_{s} which are adjacent to QQ in the graph Γ\Gamma^{*}. In total, 1{\cal F}_{1} contributes (q1)×|1|=(qs+11)(q-1)\times|{\cal F}_{1}|=(q^{s+1}-1) neighbours of QQ in Γ\Gamma^{*}.

Next we look at 2{\cal F}_{2}. Replacing ‘ss’ by ‘s+1s+1’ in (1) gives the number of subspace of dimension s+2s+2 that contain the (s+1)(s+1)-space Σ=Q,αs\Sigma=\langle Q,\alpha_{s}\rangle and are contained in {\cal E} is (qrs1+1)(qrs21)/(q1)(q^{r-s-1}+1)(q^{r-s-2}-1)/(q-1). Similarly, (2) can be generalised to show that the number of lines through QQ that lie in a subspace of dimension s+2s+2, and do not lie in the (s+1)(s+1)-space Σ\Sigma is ((qs+21)/(q1))((qs+11)/(q1))=qs+1\Big{(}(q^{s+2}-1)/(q-1)\Big{)}-\Big{(}(q^{s+1}-1)/(q-1)\Big{)}=q^{s+1}. Hence

|2|=qs+1×(qrs1+1)(qrs21)(q1).|{\cal F}_{2}|=q^{s+1}\times\frac{(q^{r-s-1}+1)(q^{r-s-2}-1)}{(q-1)}.

Each line in 2{\cal F}_{2} contains one point of Σ\Sigma, and the remaining qq points correspond to qq vertices that lie in 𝒳s\mathcal{X}_{s} (and are not considered in 1{\cal F}_{1}). That is, each line in 2{\cal F}_{2} contributes qq neighbours to QQ in the graph Γ\Gamma^{*}. So in total, 2{\cal F}_{2} contributes q×|2|=qs+2(qrs1+1)(qrs21)/(q1)q\times|{\cal F}_{2}|=q^{s+2}(q^{r-s-1}+1)(q^{r-s-2}-1)/(q-1) neighbours to QQ in the graph Γ\Gamma^{*}.

Finally we look at 3{\cal F}_{3}. Let \ell be a line in 3{\cal F}_{3}, so \ell contains QQ, but the (s+2)(s+2)-space Π=αs,\Pi=\langle\alpha_{s},\ell\rangle is not contained in {\cal E}. Suppose that \ell contains another point QQ^{\prime} that corresponds to a vertex in 𝒳s\mathcal{X}_{s}. Then Π\Pi\cap{\cal E} contains the two distinct (s+1)(s+1)-dimensional subspaces Σ=αs,Q\Sigma=\langle\alpha_{s},Q\rangle and Σ=αs,Q\Sigma^{\prime}=\langle\alpha_{s},Q^{\prime}\rangle. As Π\Pi is not contained in {\cal E}, Π\Pi meets {\cal E} in exactly the two (s+1)(s+1)-spaces Σ\Sigma and Σ\Sigma^{\prime}. Thus =QQ\ell=QQ^{\prime} is not a line of {\cal E}, and so \ell contains exactly two points Q,QQ,Q^{\prime} that are vertices of 𝒳s\mathcal{X}_{s}, moreover they are not adjacent in Γ\Gamma^{*}. Thus 3{\cal F}_{3} contributes 0 neighbours to QQ in the graph Γ\Gamma^{*}.

Summing the neighbours of QQ in Γ\Gamma^{*} obtained from the families 1,2,3{\cal F}_{1},{\cal F}_{2},{\cal F}_{3} gives the required result. Note that if s=g1s=g-1, so s=r2s=r-2, then |2|=0|{\cal F}_{2}|=0, and the degree of Γ\Gamma^{*} is qr11q^{r-1}-1. \square

Now we look at Condition II of Result 2.1. Note that throughout the proofs in this article, we consistently use P,PP,P^{\prime} to denote points of type (i); Q,QQ,Q^{\prime} to denote points of type (ii); and R,RR,R^{\prime} to denote points of type (iii).

Lemma 4.3

The partition {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} satisfies Condition II of Result 2.1 if and only if q=2q=2.

Proof  We prove this in the case 𝒬n\mathscr{Q}_{n} is =2r+1{\cal E}={\cal E}_{2r+1}, which has projective index g=r1g=r-1 and point-graph denoted Γ\Gamma_{\cal E}. The cases when 𝒬n\mathscr{Q}_{n} is 2r+1\mathcal{H}_{2r+1} and 𝒫2r\mathcal{P}_{2r} are proved in a very similar manner.

We need to show that in the graph Γ\Gamma_{\cal E}, each vertex in 𝒴s\mathcal{Y}_{s} is adjacent to 0, 12|𝒳s|\frac{1}{2}|\mathcal{X}_{s}| or |𝒳s||\mathcal{X}_{s}| vertices in 𝒳s\mathcal{X}_{s}. There are two cases to consider since the vertices in 𝒴s\mathcal{Y}_{s} are of type (i) or (iii). First consider a vertex PP in 𝒴s\mathcal{Y}_{s} of type (i). Let Q𝒳sQ\in\mathcal{X}_{s}, so QQ is a vertex of type (ii). Hence in PG(2r+1,q){\rm PG}(2r+1,q), PαsP\in\alpha_{s} and QQ lies in an (s+1)(s+1)-space Π\Pi with αsΠ\alpha_{s}\subset\Pi\subset{\cal E}. Hence PQPQ is a line of {\cal E}, and so PP and QQ are adjacent vertices in Γ\Gamma_{\cal E}. That is, each vertex of type (i) in 𝒴s\mathcal{Y}_{s} is adjacent to each of the |𝒳s||\mathcal{X}_{s}| vertices in 𝒳s\mathcal{X}_{s}.

Now consider a vertex RR in 𝒴s\mathcal{Y}_{s} of type (iii). We count the number of vertices QQ in 𝒳s\mathcal{X}_{s} for which RQRQ is a line of {\cal E}. We will show that this number is not 0 or |𝒳s||\mathcal{X}_{s}|, and further, is 12|𝒳s|\frac{1}{2}|\mathcal{X}_{s}| if and only if q=2q=2. Let Σ\Sigma be a subspace of {\cal E} of dimension s+1s+1 that contains αs\alpha_{s}. So Σ\αs\Sigma\backslash\alpha_{s} consists of points of type (ii), hence RΣR\notin\Sigma. Consider the (s+2)(s+2)-space Π=Σ,R\Pi=\langle\Sigma,R\rangle. As αsΣ\alpha_{s}\subset\Sigma, we have αs,RΠ\langle\alpha_{s},R\rangle\subset\Pi. As RR is of type (iii), αs,R\langle\alpha_{s},R\rangle is not contained in {\cal E}. Hence Π\Pi is not contained in {\cal E}. So Π\Pi\cap{\cal E} contains the (s+1)(s+1)-space Σ\Sigma and the point RΣR\notin\Sigma. Hence by Result 2.2, Π\Pi\cap{\cal E} is two distinct (s+1)(s+1)-spaces. That is, Π={Σ,Σ}\Pi\cap{\cal E}=\{\Sigma,\Sigma^{\prime}\} where Σ\Sigma^{\prime} is an (s+1)(s+1)-space that contains RR. As RR is type (iii), Σ\Sigma^{\prime} does not contain αs\alpha_{s}. Hence ΣΣ\Sigma\cap\Sigma^{\prime} is an ss-space distinct from αs\alpha_{s}, and so ΣΣαs\Sigma\cap\Sigma^{\prime}\cap\alpha_{s} is a space of dimension s1s-1. Let QQ be a point in ΣΣ\Sigma^{\prime}\cap\Sigma, QαsQ\notin\alpha_{s}, so QQ has type (ii). As Q,RΣQ,R\in\Sigma^{\prime}\subset{\cal E}, the line m=QRm=QR is a line of {\cal E}.

Suppose the line m=QRm=QR contains a second point QQ^{\prime} of type (ii). So αs,Q\langle\alpha_{s},Q^{\prime}\rangle is an (s+1)(s+1)-space contained in {\cal E}. Thus Π\Pi contains three distinct (s+1)(s+1)-spaces of {\cal E}, namely Σ,Σ,αs,Q\Sigma,\Sigma^{\prime},\langle\alpha_{s},Q^{\prime}\rangle, contradicting Result 2.2. Thus mm contains exactly one point of type (ii), namely QQ, and the rest of the points on mm are type (iii). Hence in the graph Γ\Gamma_{\cal E}, the line mm gives rise to one neighbour of RR that lies in 𝒳s\mathcal{X}_{s}, namely QQ. Thus each point of ΣΣ\Sigma^{\prime}\cap\Sigma not in αs\alpha_{s} gives rise to exactly one vertex in 𝒳s\mathcal{X}_{s} that is a neighbour of RR. This is true for every (s+1)(s+1)-space Σ\Sigma with αsΣ\alpha_{s}\subset\Sigma\subset{\cal E}. Moreover, each neighbour of RR in 𝒳s\mathcal{X}_{s} corresponds to a point of {\cal E} that lies in exactly one such (s+1)(s+1)-space, so arises exactly once in this way. Hence the number of neighbours of RR that lie in 𝒳s\mathcal{X}_{s} equals the number of points of \αs{\cal E}\backslash\alpha_{s} that lie in an (s+1)(s+1)-space Σ\Sigma with αsΣ\alpha_{s}\subset\Sigma\subset{\cal E}. We count these points.

Firstly, the number of (s+1)(s+1)-dimensional spaces that contain αs\alpha_{s} and are contained in {\cal E} is given in (1). Secondly, let Σ\Sigma be an (s+1)(s+1)-space containing αs\alpha_{s}, and Σ\Sigma^{\prime} an (s+1)(s+1)-space that meets Σ\Sigma in an ss-space not containing αs\alpha_{s}. Then the number of points in ΣΣ\Sigma\cap\Sigma^{\prime} which are not in αs\alpha_{s} is ((qs+11)/(q1))((qs1)/(q1))=qs\big{(}(q^{s+1}-1)/(q-1)\big{)}-\big{(}(q^{s}-1)/(q-1)\big{)}=q^{s}. Hence in the graph Γ\Gamma_{\cal E}, there are

y=qs(qrs+1)(qrs11)(q1)y=\frac{q^{s}\ (q^{r-s}+1)(q^{r-s-1}-1)}{(q-1)}

vertices in 𝒳s\mathcal{X}_{s} that are neighbours of RR. To satisfy Condition II of Result 2.1, we need y{0,12|𝒳s|,|𝒳s|}y\in\{0,\ \frac{1}{2}|\mathcal{X}_{s}|,\ |\mathcal{X}_{s}|\}. Now y=0y=0 if and only if rs1=0r-s-1=0, which does not occur as s<g=r1s<g=r-1. Further, |𝒳s||\mathcal{X}_{s}| is calculated in Lemma 4.1, and y<|𝒳s|y<|\mathcal{X}_{s}|. Using Lemma 4.1, y=|𝒳s|/2y=|\mathcal{X}_{s}|/2 if and only if q=2q=2.

Thus the vertices in 𝒴s\mathcal{Y}_{s} of type (i) are adjacent to |𝒳s||\mathcal{X}_{s}| of the vertices in 𝒳s\mathcal{X}_{s}. Further, the vertices in 𝒴s\mathcal{Y}_{s} of type (iii) are not adjacent to 0 or all the vertices of 𝒳s\mathcal{X}_{s}, and are adjacent to 12|𝒳s|\frac{1}{2}|\mathcal{X}_{s}| of the vertices in 𝒳s\mathcal{X}_{s} if and only if q=2q=2. That is, Condition II of Result 2.1 is satisfied in for the partition {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} of Γ\Gamma_{\cal E} if and only if q=2q=2. \square

It is now straightforward to prove Theorem 3.3.

Proof of Theorem 3.3 Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric of PG(n,2){\rm PG}(n,2) with projective index gg. Let ss be an integer with 0s<g0\leq s<g, let αs\alpha_{s} be a ss-space contained in 𝒬n\mathscr{Q}_{n}, and let {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} be the partition given in Definition 3.2. By Lemmas 4.2 and 4.3, the partition {𝒳s,𝒴s}\{\mathcal{X}_{s},\mathcal{Y}_{s}\} satisfies Conditions I and II of Result 2.1(1). Hence we can use Result 2.1(2) to construct a graph Γs\Gamma_{s}. Note that as the group fixing 𝒬n\mathscr{Q}_{n} is transitive on the ss-spaces of 𝒬n\mathscr{Q}_{n}, 0sg0\leq s\leq g, different choices of the subspace αs\alpha_{s} give rise to the same (up to isomorphism) graph. So for any ss, 0s<g0\leq s<g, the graph Γs\Gamma_{s} is a strongly regular graph with the same parameters as Γ\Gamma. \square

Remark 4.4

As 0s<g0\leq s<g, we have g1g\geq 1. This places a bound on nn: when 𝒬n\mathscr{Q}_{n} is a hyperbolic quadric, we need n3n\geq 3; when 𝒬n\mathscr{Q}_{n} is a parabolic quadric, we need n4n\geq 4; and when 𝒬n\mathscr{Q}_{n} is an elliptic quadric, we need n5n\geq 5.

It is useful to note that the proof of Lemma 4.3 gives a description of the edges in the graph Γs\Gamma_{s}. That is, let P,PP,P^{\prime} be vertices of type (i), Q,QQ,Q^{\prime} vertices of type (ii), and R,RR,R^{\prime} vertices of type (iii). Then {P,P}\{P,P^{\prime}\}, {P,Q}\{P,Q\}, {P,R}\{P,R\}, {Q,Q}\{Q,Q^{\prime}\}, {R,R}\{R,R^{\prime}\} are edges of Γs\Gamma_{s} if PPPP^{\prime}, PQPQ, PRPR, QQQQ^{\prime}, RRRR^{\prime} are lines of 𝒬n\mathscr{Q}_{n} respectively; and {Q,R}\{Q,R\} is an edge of Γs\Gamma_{s} if QRQR is a 2-secant of 𝒬n\mathscr{Q}_{n}. In summary, we have:

Corollary 4.5

Let Γs\Gamma_{s}, 0s<g0\leq s<g be the graph constructed in Theorem 3.3. The adjacencies in Γs\Gamma_{s} are the same as those given in Table 1.

Remark 4.6

We note that if q2q\neq 2, then geometric techniques similar to those used here show that the graph Γs\Gamma_{s} with s>0s>0 is not regular.

5 Maximal cliques of Γs\Gamma_{s}

In Section 5.1, we classify the maximal cliques in the graph Γs\Gamma_{s}, and in Section 5.2, we count them.

5.1 Description of Maximal Cliques of Γs\Gamma_{s}

Throughout this section, let 𝒬n\mathscr{Q}_{n} be a non-singular quadric of PG(n,2){\rm PG}(n,2) of projective index gg with point-graph Γ\Gamma. For ss an integer with 0s<g0\leq s<g, let αs\alpha_{s} be an ss-space of 𝒬n\mathscr{Q}_{n}. Let Γs\Gamma_{s} be the graph described in Theorem 3.3.

We first describe the maximal cliques of the point-graph Γ\Gamma of 𝒬n\mathscr{Q}_{n}. The largest subspaces contained in 𝒬n\mathscr{Q}_{n} are the generators, which have dimension gg, and so contain 2g+112^{g+1}-1 points. Further, any subspace of 𝒬n\mathscr{Q}_{n} is contained in a generator of 𝒬n\mathscr{Q}_{n}. Hence the maximal cliques of Γ\Gamma have 2g+112^{g+1}-1 vertices and correspond to generators of 𝒬n\mathscr{Q}_{n}.

We want to study maximal cliques in Γs\Gamma_{s}, we begin by studying cliques of Γs\Gamma_{s} of size 2g+112^{g+1}-1, then show that these are maximal. We define a gg-clique of Γs\Gamma_{s} to be a clique of size 2g+112^{g+1}-1. The next lemma describes two types of gg-cliques of Γs\Gamma_{s}, we show later that these are the maximal cliques of Γs\Gamma_{s}. The first type corresponds to generators of 𝒬n\mathscr{Q}_{n} containing αs\alpha_{s}, and so corresponds to maximal cliques of the original graph Γ\Gamma. Figure 1 illustrates the two types of gg-cliques described in Lemma 5.1.

Refer to caption
Σ\Sigmaαs\alpha_{s}Type B𝒞a{\cal C}_{a}𝒞c{\cal C}_{c}Type Aαs\alpha_{s}Σ\Sigma𝒞b{\cal C}_{b}Π\Pi
Figure 1: gg-cliques of Γs\Gamma_{s}
Lemma 5.1

Let Γs\Gamma_{s}, 0s<g0\leq s<g, be the graph constructed as in Theorem 3.3.

  • A.

    Let Σ\Sigma be a generator of 𝒬n\mathscr{Q}_{n} that contains αs\alpha_{s}, then the points of Σ\Sigma form a gg-clique of Γs\Gamma_{s}.

  • B.

    Let Π,Σ\Pi,\Sigma be two generators of 𝒬n\mathscr{Q}_{n} such that: Σ\Sigma contains αs\alpha_{s}; Π\Pi does not contain αs\alpha_{s}; and Π\Pi, Σ\Sigma meet in a (g1)(g-1)-dimensional space. Let 𝒞a{\cal C}_{a} be the 2s12^{s}-1 points of αsΠ\alpha_{s}\cap\Pi; 𝒞b{\cal C}_{b} be the 2g2s2^{g}-2^{s} points of Σ\Sigma that are not in αs\alpha_{s} or Π\Pi; and 𝒞c{\cal C}_{c} be the 2g2^{g} points of Π\Σ\Pi\backslash\Sigma, see Figure 1. Then the points in 𝒞a𝒞b𝒞c{\cal C}_{a}\cup{\cal C}_{b}\cup{\cal C}_{c} form a gg-clique of the graph Γs\Gamma_{s}.

Proof  For part A, let Σ\Sigma be a generator of 𝒬n\mathscr{Q}_{n} that contains αs\alpha_{s}. Let 𝒞{\cal C} be the set of vertices of Γs\Gamma_{s} that correspond to the points of Σ\Sigma. As 𝒞{\cal C} consists of vertices of type (i) and (ii) only, two vertices of 𝒞{\cal C} are adjacent if the corresponding two points lie on a line of 𝒬n\mathscr{Q}_{n}. As Σ\Sigma is contained in 𝒬n\mathscr{Q}_{n}, every pair of distinct points in Σ\Sigma lie in a line of 𝒬n\mathscr{Q}_{n}. Hence every pair of distinct vertices in 𝒞{\cal C} are adjacent, so 𝒞{\cal C} is a clique. Further, Σ\Sigma contains 2g+112^{g+1}-1 points, so |𝒞|=2g+11|{\cal C}|=2^{g+1}-1. Thus 𝒞{\cal C} is a gg-clique of Γs\Gamma_{s}.

We now consider the set 𝒞a𝒞b𝒞c{\cal C}_{a}\cup{\cal C}_{b}\cup{\cal C}_{c} described in part B. By construction, the three sets 𝒞a,𝒞b,𝒞c{\cal C}_{a},{\cal C}_{b},{\cal C}_{c} are pairwise disjoint, 𝒞a{\cal C}_{a} consists of points of type (i), 𝒞b{\cal C}_{b} consists of points of type (ii), and 𝒞c{\cal C}_{c} contains no points of type (i). Suppose 𝒞c{\cal C}_{c} contained a point QQ of type (ii), so αs,Q\langle\alpha_{s},Q\rangle is an (s+1)(s+1)-space of 𝒬n\mathscr{Q}_{n}. By construction, αs,Q\langle\alpha_{s},Q\rangle is not contained in Π\Pi or Σ\Sigma, so contains a point XX not in Σ\Sigma or Π\Pi. So the (g+1)(g+1)-space Π,Σ\langle\Pi,\Sigma\rangle meets 𝒬n\mathscr{Q}_{n} in at least Π,Σ,X\Pi,\Sigma,X, contradicting Result 2.2. Hence 𝒞c{\cal C}_{c} consists of points of type (iii). Note that straightforward counting shows that the number of points in 𝒞a,𝒞b,𝒞c{\cal C}_{a},{\cal C}_{b},{\cal C}_{c} is as stated in the theorem, and |𝒞a𝒞b𝒞c|=2g+11|{\cal C}_{a}\cup{\cal C}_{b}\cup{\cal C}_{c}|=2^{g+1}-1.

We need to show that any pair of vertices in the set corresponding to 𝒞a𝒞b𝒞c{\cal C}_{a}\cup{\cal C}_{b}\cup{\cal C}_{c} are adjacent. Recall Corollary 4.5 shows that the adjacencies in Γs\Gamma_{s} are as described in Table 1. Let P,P𝒞aP,P^{\prime}\in{\cal C}_{a}, Q,Q𝒞bQ,Q^{\prime}\in{\cal C}_{b}, R,R𝒞cR,R^{\prime}\in{\cal C}_{c} be distinct points. (Note that the argument below is easily adjusted to work if 𝒞a{\cal C}_{a} or 𝒞b{\cal C}_{b} has size 1.) As P,PP,P^{\prime} have type (i), Q,QQ,Q^{\prime} have type (ii) and R,RR,R^{\prime} have type (iii), the following pairs of points lie in a subspace of 𝒬n\mathscr{Q}_{n}, and so lie on a line of 𝒬n\mathscr{Q}_{n}: P,Pαs𝒬nP,P^{\prime}\in\alpha_{s}\subset\mathscr{Q}_{n}, Q,QΣ𝒬nQ,Q^{\prime}\in\Sigma\subset\mathscr{Q}_{n}, P,QΣ𝒬nP,Q\in\Sigma\subset\mathscr{Q}_{n}, P,RΠ𝒬nP,R\in\Pi\subset\mathscr{Q}_{n}, R,RΠ𝒬nR,R^{\prime}\in\Pi\subset\mathscr{Q}_{n}. Hence the corresponding pairs of vertices are all adjacent in Γs\Gamma_{s}.

To complete the proof that 𝒞a𝒞b𝒞c{\cal C}_{a}\cup{\cal C}_{b}\cup{\cal C}_{c} corresponds to a gg-clique of Γs\Gamma_{s}, we need to show that Q,RQ,R are adjacent in Γs\Gamma_{s}, so by Table 1, we need to show that QRQR is a 2-secant of 𝒬n\mathscr{Q}_{n}. The line QRQR lies in the (g+1)(g+1)-space Π,Σ\langle\Pi,\Sigma\rangle, which meets 𝒬n\mathscr{Q}_{n} in exactly Π\Pi and Σ\Sigma. As QΣ\ΠQ\in\Sigma\backslash\Pi and RΠ\ΣR\in\Pi\backslash\Sigma, the line QRQR is not contained in 𝒬n\mathscr{Q}_{n}, so it is a 2-secant of 𝒬n\mathscr{Q}_{n}. Hence QRQR is an edge of Γs\Gamma_{s}. That is, 𝒞a𝒞b𝒞c{\cal C}_{a}\cup{\cal C}_{b}\cup{\cal C}_{c} is a set of 2g+112^{g+1}-1 vertices of Γs\Gamma_{s} such that any two vertices are adjacent, and so it is a gg-clique of Γs\Gamma_{s}. \square

We will show that the only maximal cliques in Γs\Gamma_{s} are the gg-cliques of Class A and B. We need some preliminary lemmas. Note that the gg-cliques of Class A contain no points of type (iii), we begin by showing that the converse also holds.

Lemma 5.2

Let 𝒞{\cal C} be a gg-clique of Γs\Gamma_{s}, 0s<g0\leq s<g, that contains no vertices of type (iii), then 𝒞{\cal C} is a gg-clique of Class A.

Proof  Let 𝒞{\cal C} be a gg-clique of Γs\Gamma_{s}, 0s<g0\leq s<g, that contains no vertices of type (iii). Suppose 𝒞{\cal C} is not contained in a generator of 𝒬n\mathscr{Q}_{n}. We consider the number of points of 𝒞{\cal C} in each generator of 𝒬n\mathscr{Q}_{n}. Let Σ\Sigma be a generator of 𝒬n\mathscr{Q}_{n} that contains the maximum number of points of 𝒞{\cal C}. As 𝒞{\cal C} is not contained in Σ\Sigma, there is a point AA of 𝒞{\cal C} that is not in Σ\Sigma. By Result 2.3, there is a unique generator Π\Pi of 𝒬n\mathscr{Q}_{n} that contains AA and meets Σ\Sigma in a (g1)(g-1)-space. Further, the points of Σ\Sigma that lie on a line of 𝒬n\mathscr{Q}_{n} through AA are exactly the points of ΣΠ\Sigma\cap\Pi. As 𝒞{\cal C} contains no points of type (iii), edges in 𝒞{\cal C} correspond to lines of 𝒬n\mathscr{Q}_{n}. In Γs\Gamma_{s}, each vertex in 𝒞{\cal C} is adjacent to the vertex AA, so in PG(n,2){\rm PG}(n,2), the points of 𝒞Σ{\cal C}\cap\Sigma lie in ΣΠ\Sigma\cap\Pi. Hence |Π𝒞||Σ𝒞|+1|\Pi\cap{\cal C}|\geq|\Sigma\cap{\cal C}|+1, which contradicts the choice of Σ\Sigma being the generator with the largest intersection with 𝒞{\cal C}. Hence 𝒞{\cal C} is contained in a generator of 𝒬n\mathscr{Q}_{n}. As |𝒞|=2g+11|{\cal C}|=2^{g+1}-1, the vertices of 𝒞{\cal C} correspond exactly to the points of this generator, and so 𝒞{\cal C} is a Class A gg-clique. \square

Lemma 5.3

Every generator of 𝒬n\mathscr{Q}_{n} contains at least one point of type (ii).

Proof  Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric of projective index gg and let Π\Pi be a generator of 𝒬n\mathscr{Q}_{n}. There are two cases to consider. Firstly, if Π\Pi contains αs\alpha_{s}, then Π\Pi contains only points of type (i) and (ii). Hence, as s<gs<g, Π\Pi contains at least one point of type (ii). Next consider the case where Π\Pi meets αs\alpha_{s} in a subspace αt\alpha_{t} of dimension tt, with 1ts1-1\leq t\leq s-1. Let P1P_{1} be a point of αs\αt\alpha_{s}\backslash\alpha_{t}. As P1ΠP_{1}\notin\Pi, by Result 2.3 there exists a unique generator Σ1\Sigma_{1} of 𝒬n\mathscr{Q}_{n} that contains P1P_{1} and meets Π\Pi in a (g1)(g-1)-space. Moreover, if YαtY\in\alpha_{t}, then P1YαsP_{1}Y\subset\alpha_{s} and so is a line of 𝒬n\mathscr{Q}_{n}, hence by Result 2.3, αtΣ1\alpha_{t}\subset\Sigma_{1}, and so αt=ΠΣ1αs\alpha_{t}=\Pi\cap\Sigma_{1}\cap\alpha_{s}. Further, if XX is a point of ΠΣ1\Pi\cap\Sigma_{1} not in αs\alpha_{s} and Yαt,P1Y\in\langle\alpha_{t},P_{1}\rangle, then the line XYXY lies in Σ1\Sigma_{1} and so is a line of 𝒬n\mathscr{Q}_{n}.

If αsΣ1αs\alpha_{s}\cap\Sigma_{1}\neq\alpha_{s}, we repeat this process. Let P2P_{2} be a point of αs\alpha_{s} not in Σ1\Sigma_{1}. By Result 2.3 there is a generator Σ2\Sigma_{2} of 𝒬n\mathscr{Q}_{n} that contains P2P_{2} and meets Σ1\Sigma_{1} in a (g1)(g-1)-space. Moreover, if Yαt,P1Y\in\langle\alpha_{t},P_{1}\rangle, then P2YαsP_{2}Y\subset\alpha_{s}, and so is a line of 𝒬n\mathscr{Q}_{n}, hence by Result 2.3, αt,P1αsΣ2\langle\alpha_{t},P_{1}\rangle\subset\alpha_{s}\subset\Sigma_{2}. So αt,P1,P2Σ2\langle\alpha_{t},P_{1},P_{2}\rangle\subset\Sigma_{2}, and αt=ΠΣ1Σ2αs\alpha_{t}=\Pi\cap\Sigma_{1}\cap\Sigma_{2}\cap\alpha_{s}. Note that ΠΣ1Σ2\Pi\cap\Sigma_{1}\cap\Sigma_{2} has dimension at least g2g-2. Further, if XX is a point of ΠΣ1Σ2\Pi\cap\Sigma_{1}\cap\Sigma_{2} not in αs\alpha_{s}, and Yαt,P1,P2Y\in\langle\alpha_{t},P_{1},P_{2}\rangle, then XYXY lies in Σ2\Sigma_{2} and so is a line of 𝒬n\mathscr{Q}_{n}.

Repeat this process a total of kstk\leq s-t times, until αt,P1,,Pk=αs\langle\alpha_{t},P_{1},\ldots,P_{k}\rangle=\alpha_{s}. Let H=ΠΣ1ΣkH=\Pi\cap\Sigma_{1}\cap\cdots\cap\Sigma_{k}, so HH has dimension dgkg(st)d\geq g-k\geq g-(s-t), Hαs=αtH\cap\alpha_{s}=\alpha_{t}, and αs=αt,P1,,PkΣk\alpha_{s}=\langle\alpha_{t},P_{1},\ldots,P_{k}\rangle\subset\Sigma_{k}. Note that dimHdimαt=dtg(st)t=gs>0\dim H-\dim\alpha_{t}=d-t\geq g-(s-t)-t=g-s>0, so H\αtH\backslash\alpha_{t} is non-empty. Let XX be a point of HH not in αs\alpha_{s}, and let YαsY\in\alpha_{s}. So X,YΣkX,Y\in\Sigma_{k}, hence XYXY is a line of 𝒬n\mathscr{Q}_{n}. That is, X,αs\langle X,\alpha_{s}\rangle is an (s+1)(s+1)-space of 𝒬n\mathscr{Q}_{n} and hence XX is a type (ii) point. As XHΠX\in H\subset\Pi, Π\Pi contains at least one point of type (ii) as required. \square

We now show that there are only two types of gg-cliques in Γs\Gamma_{s}, namely those of Class A and B described in Lemma 5.1.

Lemma 5.4

Let 𝒞{\cal C} be a gg-clique in Γs\Gamma_{s}, 0s<g0\leq s<g, then 𝒞{\cal C} is a gg-clique of Class A or B.

Proof  Let 𝒞\mathcal{C} be a gg-clique of Γs\Gamma_{s} and denote the subsets of vertices of 𝒞\mathcal{C} of type (i), (ii), (iii) by 𝒞i{\mathcal{C}}_{{\rm i}}, 𝒞ii{\mathcal{C}}_{{\rm ii}}, 𝒞iii{\mathcal{C}}_{{\rm iii}} respectively. If 𝒞iii={\mathcal{C}}_{{\rm iii}}=\emptyset, then by Lemma 5.2, 𝒞\mathcal{C} corresponds to a generator of 𝒬n\mathscr{Q}_{n} containing αs\alpha_{s}, and so is of Class A. So suppose 𝒞iii{\mathcal{C}}_{{\rm iii}}\neq\emptyset.

We begin by constructing two generators of 𝒬n\mathscr{Q}_{n} whose union contains the gg-clique 𝒞{\cal C}. Firstly, as 𝒞{\cal C} is a clique of Γs\Gamma_{s}, the subset 𝒞i𝒞iii{\mathcal{C}}_{{\rm i}}\cup{\mathcal{C}}_{{\rm iii}} is also a clique, so any two vertices of 𝒞i𝒞iii{\mathcal{C}}_{{\rm i}}\cup{\mathcal{C}}_{{\rm iii}} are adjacent in Γs\Gamma_{s}. As 𝒞i𝒞iii{\mathcal{C}}_{{\rm i}}\cup{\mathcal{C}}_{{\rm iii}} contains only vertices of type (i) and (iii), in PG(n,2){\rm PG}(n,2), any two points of 𝒞i𝒞iii{\mathcal{C}}_{{\rm i}}\cup{\mathcal{C}}_{{\rm iii}} lie on a line of 𝒬n\mathscr{Q}_{n}. Hence 𝒞i𝒞iii{\mathcal{C}}_{{\rm i}}\cup{\mathcal{C}}_{{\rm iii}} is a subspace of 𝒬n\mathscr{Q}_{n} and so by [7, Theorem 22.4.1] is contained in a generator Π\Pi of 𝒬n\mathscr{Q}_{n}. Secondly, consider the set of points αs𝒞ii\alpha_{s}\cup{\mathcal{C}}_{{\rm ii}} in 𝒬n\mathscr{Q}_{n}. Let Q𝒞iiQ\in{\mathcal{C}}_{{\rm ii}}, so QQ has type (ii), and Q,αs\langle Q,\alpha_{s}\rangle is contained in 𝒬n\mathscr{Q}_{n}. Hence αs𝒞ii\alpha_{s}\cup{\mathcal{C}}_{{\rm ii}} is a subspace of 𝒬n\mathscr{Q}_{n} and so is contained in a generator Σ\Sigma of 𝒬n\mathscr{Q}_{n}. So we have 𝒞ΠΣ{\cal C}\subset\Pi\cup\Sigma. To show that 𝒞{\cal C} is a clique of Class B, we need to show that ΠΣ\Pi\cap\Sigma has dimension g1g-1.

We first show that 𝒞ii{\mathcal{C}}_{{\rm ii}} is not empty. Suppose 𝒞ii={\mathcal{C}}_{{\rm ii}}=\emptyset, then 𝒞=𝒞i𝒞iii{\cal C}={\mathcal{C}}_{{\rm i}}\cup{\mathcal{C}}_{{\rm iii}} is contained in the gg-space Π\Pi. As |𝒞|=2g+11|{\cal C}|=2^{g+1}-1, we have 𝒞=𝒞i𝒞iii=Π{\cal C}={\mathcal{C}}_{{\rm i}}\cup{\mathcal{C}}_{{\rm iii}}=\Pi. However, by Lemma 5.3, Π\Pi contains at least one point of type (ii), a contradiction. Thus 𝒞ii{\mathcal{C}}_{{\rm ii}}\neq\emptyset.

As 𝒞ii,𝒞iii{\mathcal{C}}_{{\rm ii}},{\mathcal{C}}_{{\rm iii}} are not empty, let Q𝒞iiQ\in{\mathcal{C}}_{{\rm ii}} and R𝒞iiiR\in{\mathcal{C}}_{{\rm iii}}. As Q,RQ,R lie in a clique of Γs\Gamma_{s}, they are adjacent in Γs\Gamma_{s}. Hence by Corollary 4.5, QRQR is a 2-secant of 𝒬n\mathscr{Q}_{n}. As Q𝒞iiΣ𝒬nQ\in{\mathcal{C}}_{{\rm ii}}\subset\Sigma\subset\mathscr{Q}_{n} and QRQR is a 2-secant, we have RΣR\notin\Sigma. Similarly R𝒞iiiΠ𝒬nR\in{\mathcal{C}}_{{\rm iii}}\subset\Pi\subset\mathscr{Q}_{n} and QRQR a 2-secant implies QΠQ\notin\Pi. In summary, we have

𝒞ΣΠ;𝒞iαsΠΣ;𝒞iiΣ\Π;𝒞iiiΠ\Σ.{\cal C}\subset\Sigma\cup\Pi;\quad{\mathcal{C}}_{{\rm i}}\subset\alpha_{s}\cap\Pi\cap\Sigma;\quad{\mathcal{C}}_{{\rm ii}}\subset\Sigma\backslash\Pi;\quad{\mathcal{C}}_{{\rm iii}}\subset\Pi\backslash\Sigma.

Next we determine the size of 𝒞i{\mathcal{C}}_{{\rm i}}, 𝒞ii{\mathcal{C}}_{{\rm ii}} and 𝒞iii{\mathcal{C}}_{{\rm iii}}. As 𝒞iii{\mathcal{C}}_{{\rm iii}}\neq\emptyset, there is a point R𝒞iiiR\in{\mathcal{C}}_{{\rm iii}}, so RΣR\notin\Sigma. By Result 2.3, there is a unique generator Π1\Pi_{1} of 𝒬n\mathscr{Q}_{n} that contains RR and meets Σ\Sigma in a (g1)(g-1)-space denoted H=ΣΠ1H=\Sigma\cap\Pi_{1}. There are two cases to consider as HαsH\cap\alpha_{s} has dimension ss or s1s-1. If HH contained αs\alpha_{s}, then R,αsΠ1\langle R,\alpha_{s}\rangle\subset\Pi_{1} would be a subspace of 𝒬n\mathscr{Q}_{n}, which implies that RR is type (ii), a contradiction. Thus HαsH\cap\alpha_{s} is an (s1)(s-1)-space. If P𝒞iP\in{\mathcal{C}}_{{\rm i}}, then P,R𝒞P,R\in{\cal C}, so P,RP,R are adjacent in Γs\Gamma_{s} and so PRPR is a line of 𝒬n\mathscr{Q}_{n}. Thus PHP\in H, and so PHαsP\in H\cap\alpha_{s}. Thus 𝒞iHαs{\mathcal{C}}_{{\rm i}}\subseteq H\cap\alpha_{s}, and so |𝒞i||Hαs|=2s1|{\mathcal{C}}_{{\rm i}}|\leq|H\cap\alpha_{s}|=2^{s}-1. By the construction of HH, each point in H\αsH\backslash\alpha_{s} lies on a line of 𝒬n\mathscr{Q}_{n} with RR, and each point of Σ\(Hαs)\Sigma\backslash(H\cup\alpha_{s}) lies on a 2-secant of 𝒬n\mathscr{Q}_{n} with RR. So the type (ii) points of 𝒞{\cal C} are contained in Σ\(Hαs)\Sigma\backslash(H\cup\alpha_{s}). That is, |𝒞ii||Σ\(Hαs)|=(2g+11)((2g1)+2s))=2g2s|{\mathcal{C}}_{{\rm ii}}|\leq|\Sigma\backslash(H\cup\alpha_{s})|=(2^{g+1}-1)-\big{(}(2^{g}-1)+2^{s})\big{)}=2^{g}-2^{s}.

As 𝒞ii{\mathcal{C}}_{{\rm ii}}\neq\emptyset, there is a point Q𝒞iiQ\in{\mathcal{C}}_{{\rm ii}}, so QΣ\ΠQ\in\Sigma\backslash\Pi. By Result 2.3, there is a unique generator Σ1\Sigma_{1} of 𝒬n\mathscr{Q}_{n} that contains QQ and meets Π\Pi in a (g1)(g-1)-space. Hence QQ is on a line of 𝒬n\mathscr{Q}_{n} with the 2g12^{g}-1 points of ΠΣ1\Pi\cap\Sigma_{1}; and QQ is on a 2-secant of 𝒬n\mathscr{Q}_{n} with the (2g+11)(2g1)=2g(2^{g+1}-1)-(2^{g}-1)=2^{g} points of Π\Σ1\Pi\backslash\Sigma_{1}. If RR is a point of 𝒞iii{\mathcal{C}}_{{\rm iii}}, then as Q,R𝒞Q,R\in{\cal C}, they are adjacent in Γs\Gamma_{s} and so QRQR is a 2-secant of 𝒬n\mathscr{Q}_{n}. Hence the points of 𝒞iii{\mathcal{C}}_{{\rm iii}} lie in Π\Σ1\Pi\backslash\Sigma_{1}, and so |𝒞iii|2g|{\mathcal{C}}_{{\rm iii}}|\leq 2^{g}.

As |𝒞|=2g+11|{\cal C}|=2^{g+1}-1, we need equality in all three of these bounds, that is, |𝒞i|=2s1|{\mathcal{C}}_{{\rm i}}|=2^{s}-1, |𝒞ii|=2g2s|{\mathcal{C}}_{{\rm ii}}|=2^{g}-2^{s}, and |𝒞iii|=2g|{\mathcal{C}}_{{\rm iii}}|=2^{g}. Moreover,

𝒞i=αsΠ1,𝒞ii=Σ\(αsΠ1),𝒞iii=Π\Σ1.{\mathcal{C}}_{{\rm i}}=\alpha_{s}\cap\Pi_{1},\quad{\mathcal{C}}_{{\rm ii}}=\Sigma\backslash(\alpha_{s}\cup\Pi_{1}),\quad{\mathcal{C}}_{{\rm iii}}=\Pi\backslash\Sigma_{1}. (3)

To show that 𝒞{\cal C} is a gg-clique of Class B, we need to show that Π=Π1\Pi=\Pi_{1} and Σ=Σ1\Sigma=\Sigma_{1}. Suppose that ΠΠ1\Pi\neq\Pi_{1}, so ΠΠ1\Pi\cap\Pi_{1} has dimension at most g1g-1, that is |ΠΠ1|2g1|\Pi\cap\Pi_{1}|\leq 2^{g}-1. As Π\Pi contains 𝒞iii{\mathcal{C}}_{{\rm iii}}, and |𝒞iii|=2g>|ΠΠ1||{\mathcal{C}}_{{\rm iii}}|=2^{g}>|\Pi\cap\Pi_{1}|, there exists a point R𝒞iiiR^{\prime}\in{\mathcal{C}}_{{\rm iii}} with RΠ\Π1R^{\prime}\in\Pi\backslash\Pi_{1}. By Result 2.3, there exists a unique generator Π2\Pi_{2} of 𝒬n\mathscr{Q}_{n} which contains RR^{\prime} and meets Σ\Sigma in a (g1)(g-1)-space. Further, for each point XΣ\Π2X\in\Sigma\backslash\Pi_{2}, XRXR^{\prime} is a 2-secant of 𝒬n\mathscr{Q}_{n}. Thus 𝒞iiΣ\Π2{\mathcal{C}}_{{\rm ii}}\subset\Sigma\backslash\Pi_{2}. By (3), 𝒞ii=Σ\(αsΠ1){\mathcal{C}}_{{\rm ii}}=\Sigma\backslash(\alpha_{s}\cup\Pi_{1}), moreover we have |Σ\(αsΠ1)|=|Σ\(αsΠ2)||\Sigma\backslash(\alpha_{s}\cup\Pi_{1})|=|\Sigma\backslash(\alpha_{s}\cup\Pi_{2})|. Hence ΣΠ1=ΣΠ2\Sigma\cap\Pi_{1}=\Sigma\cap\Pi_{2}, and so Π1Π2\Pi_{1}\cap\Pi_{2} is a (g1)(g-1)-space in Σ\Sigma. Recall that RΠ1R\in\Pi_{1}, and by assumption RΠ2\Π1R^{\prime}\in\Pi_{2}\backslash\Pi_{1}, so Π1Π2\Pi_{1}\neq\Pi_{2}. Thus Π1,Π2\langle\Pi_{1},\Pi_{2}\rangle is a (g+1)(g+1)-space, and so by Result 2.2, meets 𝒬n\mathscr{Q}_{n} in exactly the two generators Π1,Π2\Pi_{1},\Pi_{2}. Now R,R𝒞iiiR,R^{\prime}\in{\mathcal{C}}_{{\rm iii}}, so {R,R}\{R,R^{\prime}\} is an edge of Γs\Gamma_{s}, and so RRRR^{\prime} is a line of 𝒬n\mathscr{Q}_{n}. As RΠ2\Π1R^{\prime}\in\Pi_{2}\backslash\Pi_{1}, and RRRR^{\prime} is a line of 𝒬n\mathscr{Q}_{n} in Π1,Π2\langle\Pi_{1},\Pi_{2}\rangle, we have RΠ2R\in\Pi_{2}. So RΠ2Π1ΣR\in\Pi_{2}\cap\Pi_{1}\subset\Sigma, contradicting the choice of RΣR\not\in\Sigma. Hence Π=Π1\Pi=\Pi_{1}. Thus Σ\Sigma meets Π\Pi in a (g1)(g-1)-space, so by the construction of Σ1\Sigma_{1}, we have Σ=Σ1\Sigma=\Sigma_{1}. Substituting into (3), we see that 𝒞{\cal C} is a gg-clique of Class B. \square

Lemma 5.5

The maximum size of a clique in Γs\Gamma_{s} is 2g+112^{g+1}-1.

Proof  Suppose Γs\Gamma_{s}, s>0s>0, contains a clique 𝒦\mathcal{K} of size 2g+12^{g+1}. Let XX be a vertex in 𝒦\mathcal{K}, then 𝒦\X\mathcal{K}\backslash X is a gg-clique, and so by Theorem 5.4, 𝒦\X\mathcal{K}\backslash X has Class A or B. Table 2 gives the number of vertices of each type in the two different gg-cliques.

Table 2: Number of vertices of each type in each gg-clique
gg-clique A gg-clique B
vertex type (i) 2s+112^{s+1}-1 2s12^{s}-1
vertex type (ii) 2g+12s+12^{g+1}-2^{s+1} 2g2s2^{g}-2^{s}
vertex type (iii) 0 2g2^{g}

As s>0s>0 and 𝒦\X\mathcal{K}\backslash X has Class A or B, 𝒦\X\mathcal{K}\backslash X contains vertices of both type (i) and (ii). Let PP be a vertex of type (i) in 𝒦\mathcal{K} and QQ a vertex of type (ii) in 𝒦\mathcal{K}. If 𝒦\P\mathcal{K}\backslash P has Class A, then using Table 2, we see that 𝒦\Q\mathcal{K}\backslash Q satisfies neither column, and so is not a gg-clique of Γs\Gamma_{s}, a contradiction. Similarly, if 𝒦\P\mathcal{K}\backslash P has Class B, then 𝒦\Q\mathcal{K}\backslash Q satisfies neither column, and so is not a gg-clique of Γs\Gamma_{s}. So there are no cliques of size 2g+12^{g+1}, hence the gg-cliques are the maximal cliques of Γs\Gamma_{s}. A similar argument proves the result when s=0s=0. \square

In summary, we have classified the maximal cliques of Γs\Gamma_{s} as follows.

Theorem 5.6

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric of PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1, and let Γs\Gamma_{s}, 0s<g0\leq s<g, be the graph constructed in Theorem 3.3. If 𝒞{\cal C} is a maximal clique of Γs\Gamma_{s}, then 𝒞{\cal C} is a gg-clique of Class A or B.

5.2 Counting maximal cliques

In the previous section, we classified the maximal cliques in the graph Γs\Gamma_{s}, we count them here.

Theorem 5.7

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1. Let Γ\Gamma be the point-graph of 𝒬n\mathscr{Q}_{n} and let Γs\Gamma_{s}, 0s<g0\leq s<g, be the graph constructed in Theorem 3.3.

  1. 1.

    Let 𝒬n=2r+1\mathscr{Q}_{n}={\cal E}_{2r+1}, then

    1. (a)

      Γ\Gamma has (22+1)(23+1)(2r+1+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r+1}+1) maximal cliques.

    2. (b)

      Γs\Gamma_{s} has (22+1)(23+1)(2rs+1)×(2r+22rs+1+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s}+1)\times\big{(}2^{r+2}-2^{r-s+1}+1\big{)} maximal cliques.

  2. 2.

    If 𝒬n=2r+1\mathscr{Q}_{n}=\mathcal{H}_{2r+1}, then

    1. (a)

      Γ\Gamma has (20+1)(21+1)(2r+1)(2^{0}+1)(2^{1}+1)\cdots(2^{r}+1) maximal cliques.

    2. (b)

      Γs\Gamma_{s} has (20+1)(21+1))(2rs1+1)×(2r+12rs+1)(2^{0}+1)(2^{1}+1))\cdots(2^{r-s-1}+1)\times\big{(}2^{r+1}-2^{r-s}+1\big{)} maximal cliques.

  3. 3.

    If 𝒬n=𝒫2r\mathscr{Q}_{n}=\mathcal{P}_{2r}, then

    1. (a)

      Γ\Gamma has (21+1)(22+1)(2r+1)(2^{1}+1)(2^{2}+1)\cdots(2^{r}+1) maximal cliques.

    2. (b)

      Γs\Gamma_{s} has (21+1)(22+1)(2rs1+1)×(2r+12rs+1)(2^{1}+1)(2^{2}+1)\cdots(2^{r-s-1}+1)\times\big{(}2^{r+1}-2^{r-s}+1\big{)} maximal cliques.

Proof  For part 1, we work in PG(2r+1,2){\rm PG}(2r+1,2) and let 𝒬n==2r+1\mathscr{Q}_{n}={\cal E}={\cal E}_{2r+1} have point-graph Γ\Gamma. The maximal cliques of Γ\Gamma correspond exactly to the generators of {\cal E}. By [7, Theorem 22.5.1], the number of generators of {\cal E} is

(22+1)(23+1)(2r+1+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r+1}+1)

proving 1(a). For part 1(b), let αs\alpha_{s} be a subspace of {\cal E}, 0s<g0\leq s<g, and let Γs\Gamma_{s} be the graph constructed from Γ\Gamma as in Theorem 3.3. Let nAn_{\rm A}, nBn_{\rm B} be the number of maximal cliques of Γs\Gamma_{s} of Class A and B respectively. By Lemma 5.1, nAn_{\rm A} is equal to the number of generators of {\cal E} that contain αs\alpha_{s}, and so by [7, Theorem 22.4.7],

nA=(22+1)(23+1)(2rs+1).n_{\rm A}=(2^{2}+1)(2^{3}+1)\cdots(2^{r-s}+1). (4)

To count the maximal cliques of Class B, by Lemma 5.1 we need to count the number of pairs of generators Σ,Π\Sigma,\Pi of {\cal E} such that Σ\Sigma contains αs\alpha_{s}, and Π\Pi meets Σ\Sigma in a (g1)(g-1)-space not containing αs\alpha_{s}. The number of choices for Σ\Sigma is the number of generators of {\cal E} that contain αs\alpha_{s}, which is given in (4), and is nAn_{\rm A}. Once Σ\Sigma is chosen, we count the number of choices for Π\Pi. The number of (g1)(g-1)-spaces contained in Σ\Sigma but not containing αs\alpha_{s} equals the number of (g1)(g-1)-spaces contained in Σ\Sigma minus the number of (g1)(g-1)-spaces contained in Σ\Sigma which contain αs\alpha_{s}. This is (2g+11)(2gs1)=2g+12gs(2^{g+1}-1)-(2^{g-s}-1)=2^{g+1}-2^{g-s}. By [7, Lemma 22.4.8], the number of generators of {\cal E} that meet Σ\Sigma in a fixed (g1)(g-1)-space is four. Hence the number of choices for Π\Pi is (2g+12gs)×4=2g+32gs+2(2^{g+1}-2^{g-s})\times 4=2^{g+3}-2^{g-s+2}. As the projective index of {\cal E} is g=r1g=r-1, we have nB=nA(2g+32gs+2)=nA(2r+22rs+1)n_{\rm B}=n_{\rm A}\big{(}2^{g+3}-2^{g-s+2}\big{)}=n_{\rm A}\big{(}2^{r+2}-2^{r-s+1}\big{)}. Hence the total number of maximal cliques of Γs\Gamma_{s} is nA+nB=nA(2r+22rs+1+1)n_{\rm A}+n_{\rm B}=n_{\rm A}\big{(}2^{r+2}-2^{r-s+1}+1\big{)} as required. This completes the proof of part 1. The proofs of parts 2 and 3 are similar. \square

Theorem 5.8

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1. Let Γs\Gamma_{s}, 0s<g0\leq s<g, be the graph constructed in Theorem 3.3. Let XX be a fixed vertex of Γs\Gamma_{s}, then the number of maximal cliques of Γs\Gamma_{s} containing XX according to the type of XX is given in the next table.

number of maximal cliques of Γs\Gamma_{s} containing XX
𝒬n\mathscr{Q}_{n} type of XX 0s<g10\leq s<g-1 s=g1s=g-1
2r+1{\cal E}_{2r+1} (i) (22+1)(23+1)(2rs+1)×(2r+12rs+1+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s}+1)\times\big{(}2^{r+1}-2^{r-s+1}+1\big{)} 5(2r+17)5(2^{r+1}-7)
(ii) (22+1)(23+1)(2rs1+1)×(2r+12rs+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s-1}+1)\times\big{(}2^{r+1}-2^{r-s}+1\big{)} 2r+132^{r+1}-3
(iii) (22+1)(23+1)(2rs+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s}+1) 5
2r+1\mathcal{H}_{2r+1} (i) (20+1)(21+1)(2rs1+1)×(2r2rs+1)(2^{0}+1)(2^{1}+1)\cdots(2^{r-s-1}+1)\times\big{(}2^{r}-2^{r-s}+1\big{)} 2(2r1)2(2^{r}-1)
(ii) (20+1)(21+1)(2rs2+1)×(2r2rs1+1)(2^{0}+1)(2^{1}+1)\cdots(2^{r-s-2}+1)\times\big{(}2^{r}-2^{r-s-1}+1\big{)} 2r2^{r}
(iii) (20+1)(21+1)(2rs1+1)(2^{0}+1)(2^{1}+1)\cdots(2^{r-s-1}+1) 22
𝒫2r\mathcal{P}_{2r} (i) (21+1)(22+1)(2rs1+1)×(2r2rs+1)(2^{1}+1)(2^{2}+1)\cdots(2^{r-s-1}+1)\times\big{(}2^{r}-2^{r-s}+1\big{)} 3(2r3)3(2^{r}-3)
(ii) (21+1)(22+1)(2rs2+1)×(2r2rs1+1)(2^{1}+1)(2^{2}+1)\cdots(2^{r-s-2}+1)\times\big{(}2^{r}-2^{r-s-1}+1\big{)} 2r12^{r}-1
(iii) (21+1)(22+1)(2rs1+1)(2^{1}+1)(2^{2}+1)\cdots(2^{r-s-1}+1) 3

Proof  First consider the case where 𝒬n==2r+1\mathscr{Q}_{n}={\cal E}={\cal E}_{2r+1} in PG(n,2)=PG(2r+1,2){\rm PG}(n,2)={\rm PG}(2r+1,2). Let αs\alpha_{s} be a subspace of {\cal E}, 0s<g0\leq s<g, and let Γs\Gamma_{s} be the graph constructed from the point-graph Γ\Gamma of {\cal E}, as in Theorem 3.3. Let PP be a vertex of Γs\Gamma_{s} of type (i), so in PG(2r+1,2){\rm PG}(2r+1,2), PαsP\in\alpha_{s}. All the maximal cliques of Γs\Gamma_{s} of Class A contain αs\alpha_{s}. So by (4), PP lies in nA=(22+1)(23+1)(2rs+1)n_{\rm A}=(2^{2}+1)(2^{3}+1)\cdots(2^{r-s}+1) maximal cliques of Class A. To form a maximal clique of Γs\Gamma_{s} of Class B that contains PP, we need two generators Σ,Π\Sigma,\Pi of {\cal E} such that Σ\Sigma contains αs\alpha_{s}, Π\Pi meets Σ\Sigma in a (g1)(g-1)-space not containing αs\alpha_{s}, and PΠP\in\Pi. We count the number of pairs Σ\Sigma, Π\Pi satisfying this. First, the number of choices for Σ\Sigma equals the number of generators of {\cal E} containing αs\alpha_{s} which is nAn_{\rm A}. The number of (g1)(g-1)-spaces of Σ\Sigma that contain PP is 2g12^{g}-1, and the number of (g1)(g-1)-spaces of Σ\Sigma that contain αs\alpha_{s} and PP is 2gs12^{g-s}-1. Hence the number of (g1)(g-1)-spaces of Σ\Sigma that contain PP, but do not contain αs\alpha_{s} is (2g1)(2gs1)=2g2gs(2^{g}-1)-(2^{g-s}-1)=2^{g}-2^{g-s}. By [7, Lemma 22.4.8], the number of generators of {\cal E} that meet Σ\Sigma in a fixed (g1)(g-1)-space is four. In total, the number of maximal cliques of Class B containing PP is nA×(2g2gs)×4=nA(2r+12rs+1)n_{\rm A}\times(2^{g}-2^{g-s})\times 4=n_{\rm A}\big{(}2^{r+1}-2^{r-s+1}\big{)} as {\cal E} has projective index g=r1g=r-1. Hence the total number of maximal cliques of Γs\Gamma_{s} containing PP is nA(2r+12rs+1+1)n_{\rm A}\big{(}2^{r+1}-2^{r-s+1}+1\big{)} as required.

Now let QQ be a vertex of Γs\Gamma_{s} of type (ii). The number of maximal cliques of Class A containing QQ equals the number of generators of {\cal E} containing αs\alpha_{s} and QQ which by [7, Theorem 22.4.7] is (22+1)(23+1)(2rs1+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s-1}+1). To count the maximal cliques of Γs\Gamma_{s} that contain QQ, we need to count pairs of generators Σ,Π\Sigma,\Pi of {\cal E} such that Σ\Sigma contains αs\alpha_{s} and QQ, and Π\Pi meets Σ\Sigma in a (g1)(g-1)-space not containing αs\alpha_{s} or QQ. The number of choices for Σ\Sigma is calculated above to be (22+1)(23+1)(2rs1+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s-1}+1). Further, the number of (g1)(g-1)-spaces in Σ\Sigma is 2g+112^{g+1}-1; the number of (g1)(g-1)-spaces of Σ\Sigma containing αs\alpha_{s} is 2gs12^{g-s}-1; the number of (g1)(g-1)-spaces of Σ\Sigma containing αs\alpha_{s} and QQ is 2gs112^{g-s-1}-1; and the number of (g1)(g-1)-spaces of Σ\Sigma containing QQ is 2g12^{g}-1. Hence the number of (g1)(g-1)-spaces of Σ\Sigma that do not contain αs\alpha_{s} and do not contain QQ is (2g+11)(2gs1)(2g1)+(2gs11)=2g2gs1(2^{g+1}-1)-(2^{g-s}-1)-(2^{g}-1)+(2^{g-s-1}-1)=2^{g}-2^{g-s-1}. As before, each of these (g1)(g-1)-spaces lies in four suitable choices for the generator Π\Pi of {\cal E}. Hence the number of maximal cliques of Class B containing QQ is (22+1)(23+1)(2rs1+1)×(2g2gs1)×4=(22+1)(23+1)(2rs1+1)(2r+12rs)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s-1}+1)\times(2^{g}-2^{g-s-1})\times 4=(2^{2}+1)(2^{3}+1)\cdots(2^{r-s-1}+1)\big{(}2^{r+1}-2^{r-s}\big{)} as {\cal E} has projective index g=r1g=r-1. Hence the total number of maximal cliques containing QQ is (22+1)(23+1)(2rs1+1)(2r+12rs+1)(2^{2}+1)(2^{3}+1)\cdots(2^{r-s-1}+1)\big{(}2^{r+1}-2^{r-s}+1\big{)} as required.

Let RR be a vertex of Γs\Gamma_{s} of type (iii), so R,αs\langle R,\alpha_{s}\rangle is not contained in {\cal E}, hence RR is in zero maximal cliques of Class A. To count the maximal cliques of Γs\Gamma_{s} of Class B containing RR, we need to count pairs of generators Σ,Π\Sigma,\Pi of {\cal E} such that Σ\Sigma contains αs\alpha_{s}, Π\Pi meets Σ\Sigma in a (g1)(g-1)-space not containing αs\alpha_{s}, and Π\Pi contains RR. The number of choices for Σ\Sigma equals the number of generators of {\cal E} containing αs\alpha_{s} which is nAn_{\rm A} by (4). As Σ\Sigma contains αs\alpha_{s}, it contains no points of type (iii), so RΣR\notin\Sigma. So by Result 2.3, there is a unique generator of {\cal E} that contains RR and meets Σ\Sigma in a (g1)(g-1)-space denoted HH. Further, if HH contained αs\alpha_{s}, then R,αs\langle R,\alpha_{s}\rangle would be contained in {\cal E}, and so RR would be type (ii), a contradiction, so HH does not contain αs\alpha_{s}. So for each Σ\Sigma, there is a unique choice for Π\Pi that can be used to form a Class B maximal clique containing RR. Hence the number of maximal cliques of Γs\Gamma_{s} containing RR is nA=(22+1)(23+1)(2rs+1)n_{\rm A}=(2^{2}+1)(2^{3}+1)\cdots(2^{r-s}+1) as required. This completes the proof for the case 𝒬n=2r+1\mathscr{Q}_{n}={\cal E}_{2r+1}. The cases when 𝒬n\mathscr{Q}_{n} is 2r+1\mathcal{H}_{2r+1} and 𝒫2r\mathcal{P}_{2r} are similar. \square

6 The graphs Γs\Gamma_{s} are all non-isomorphic

Theorem 6.1

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1. Let Γ\Gamma be the point-graph of 𝒬n\mathscr{Q}_{n} and let Γs\Gamma_{s}, 0s<g0\leq s<g, be the graph constructed in Theorem 3.3. Then Γs\Gamma_{s} is isomorphic to Γ\Gamma if and only if s=0s=0.

Proof  We first show that Γ0Γ\Gamma_{0}\cong\Gamma. To construct Γ0\Gamma_{0} from Γ\Gamma, we let α0\alpha_{0} be a subspace of 𝒬n\mathscr{Q}_{n} of dimension 0, so α0\alpha_{0} is a point which we denote PP. We classify the points of 𝒬n\mathscr{Q}_{n}, and so the vertices of Γ\Gamma, into type (i), (ii), (iii) with respect to α0=P\alpha_{0}=P. The point PP is the only point of 𝒬n\mathscr{Q}_{n} of type (i). Note that lines in PG(n,2){\rm PG}(n,2) contain exactly three points. Consider the involution ϕ\phi acting on the vertices of Γ\Gamma where: ϕ\phi fixes vertices of type (i) and (iii); and ϕ\phi maps a vertex QQ of type (ii) to the vertex of type (ii) that corresponds to the third point of 𝒬n\mathscr{Q}_{n} on the line PQPQ. The involution ϕ\phi maps Γ\Gamma to a graph Γ\Gamma^{\prime}. Incidence in Γ\Gamma^{\prime} is inherited from Γ\Gamma, that is, points XX and YY are adjacent in Γ\Gamma (so XYXY is a line of 𝒬n\mathscr{Q}_{n}) if and only if vertices ϕ(X)\phi(X) and ϕ(Y)\phi(Y) are adjacent in Γ\Gamma^{\prime}. The map ϕ\phi is an isomorphism, so ΓΓ\Gamma\cong\Gamma^{\prime}. We now show that Γ=Γ0\Gamma^{\prime}=\Gamma_{0}.

By Corollary 4.5, we need to show that the edges of Γ\Gamma^{\prime} satisfy Table 1. First note that as there is only one point of type (i) in 𝒬n\mathscr{Q}_{n}, the first row of Table 1 is not relevant. Let Q1,Q2Q_{1},Q_{2} be points of 𝒬n\mathscr{Q}_{n} of type (ii), and let R,RR,R^{\prime} be points of 𝒬n\mathscr{Q}_{n} of type (iii). The incidences in rows 4 and 5 of Table 1 hold in Γ\Gamma, so as ϕ\phi fixes points of type (i) and (iii), they also hold in Γ\Gamma^{\prime}.

To simplify notation, let Q1=ϕ1(Q1)Q_{1}^{\prime}=\phi^{-1}(Q_{1}) and ϕ1(Q2)=Q2\phi^{-1}(Q_{2})=Q_{2}^{\prime}. Consider row 2 of Table 1: {P,Q1}\{P,Q_{1}\} is an edge of Γ\Gamma^{\prime} if and only if {P,Q1}\{P,Q_{1}^{\prime}\} is an edge of Γ\Gamma if and only if {P,Q1,Q1}\{P,Q_{1},Q_{1}^{\prime}\} is a line of 𝒬n\mathscr{Q}_{n}. Hence it follows from the definition of ϕ\phi that {P,Q1}\{P,Q_{1}\} is always an edge of Γ\Gamma^{\prime} as required.

Consider row 6 of Table 1: {Q1,R}\{Q_{1},R\} is an edge of Γ\Gamma^{\prime} if {Q1,R}\{Q_{1}^{\prime},R\} is an edge of Γ\Gamma, that is, if Q1RQ_{1}^{\prime}R is a line of 𝒬n\mathscr{Q}_{n}. As RR is type (iii), the plane P,Q1,R\langle P,Q_{1}^{\prime},R\rangle is not contained in 𝒬n\mathscr{Q}_{n}, and so by Result 2.2 meets 𝒬n\mathscr{Q}_{n} in exactly the lines PQ1PQ_{1}^{\prime}, Q1RQ_{1}^{\prime}R. As Q1Q_{1} is the third point on the line PQ1PQ_{1}^{\prime}, the line Q1RQ_{1}R is a 2-secant of 𝒬n\mathscr{Q}_{n} as required.

Consider row 3 of Table 1. Suppose {Q1,Q2}\{Q_{1},Q_{2}\} is an edge of Γ\Gamma^{\prime}, so {Q1,Q2}\{Q_{1}^{\prime},Q_{2}^{\prime}\} is an edge of Γ\Gamma. If the line Q1Q2Q_{1}Q_{2} contains PP, then Q1=Q2Q_{1}^{\prime}=Q_{2} and Q2=Q1Q_{2}^{\prime}=Q_{1}, so {Q1,Q2}\{Q_{1},Q_{2}\} is an edge of Γ\Gamma and so Q1Q2Q_{1}Q_{2} is a line of 𝒬n\mathscr{Q}_{n} as required. Now suppose Q1Q2Q_{1}Q_{2} does not contain PP. Then {Q1,Q2}\{Q_{1}^{\prime},Q_{2}^{\prime}\} an edge of Γ\Gamma implies Q1Q2Q_{1}^{\prime}Q_{2}^{\prime} is a line of 𝒬n\mathscr{Q}_{n}. Hence the plane P,Q1,Q2\langle P,Q_{1}^{\prime},Q_{2}^{\prime}\rangle contains at least three lines, namely PQ1PQ_{1}^{\prime}, PQ2PQ_{2}^{\prime} and Q1Q2Q_{1}^{\prime}Q_{2}^{\prime}, and so by Result 2.2, is contained in 𝒬n\mathscr{Q}_{n}. Further, it contains Q1Q_{1} and Q2Q_{2}, so Q1Q2Q_{1}Q_{2} is a line of 𝒬n\mathscr{Q}_{n} as required. Hence the edges of Γ\Gamma^{\prime} satisfy Table 1. So by Corollary 4.5, Γ=Γ0\Gamma^{\prime}=\Gamma_{0}.

We now show that Γs\Gamma_{s} with 1s<g1\leq s<g is not isomorphic to the graph ΓΓ0\Gamma\cong\Gamma_{0} by considering the maximal cliques. We prove the case when 𝒬n==2r+1\mathscr{Q}_{n}={\cal E}={\cal E}_{2r+1}, the cases where 𝒬n\mathscr{Q}_{n} is 2r+1\mathcal{H}_{2r+1} or 𝒫2r\mathcal{P}_{2r} are similar. The number of maximal cliques in Γ\Gamma and Γs\Gamma_{s} are given in (1a) and (1b) of Theorem 5.7. These numbers are equal if and only if 2r+12rs+1+1=(2rs+1+1)(2r+1)2^{r+1}-2^{r-s+1}+1=(2^{r-s+1}+1)\cdots(2^{r}+1). If s1s\geq 1, then the right hand side is 22r+1\geq 2^{2r+1}, which is larger than the left hand side. So we have equality if and only if s=0s=0. Hence Γs\Gamma_{s} with 1s<g1\leq s<g is not isomorphic to Γ\Gamma. \square

Theorem 6.2

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1. Let Γ\Gamma be the point-graph of 𝒬n\mathscr{Q}_{n} and let Γs\Gamma_{s}, 0s<g0\leq s<g, be the graph constructed in Theorem 3.3. Then the graphs Γ0,Γ1,,Γg1\Gamma_{0},\Gamma_{1},\ldots,\Gamma_{g-1} are distinct up to isomorphism.

Proof  We prove the case when 𝒬n==2r+1\mathscr{Q}_{n}={\cal E}={\cal E}_{2r+1}, the cases where 𝒬n\mathscr{Q}_{n} is 2r+1\mathcal{H}_{2r+1} or 𝒫2r\mathcal{P}_{2r} are similar. Let s1,s2s_{1},s_{2} be two integers with 0s1<s2<g0\leq s_{1}<s_{2}<g. The number of maximal cliques in Γs1\Gamma_{s_{1}} and Γs2\Gamma_{s_{2}} are given in Theorem 5.7(1b). These two numbers are equal if and only if

2r+22rs2+1+1\displaystyle 2^{r+2}-2^{r-s_{2}+1}+1 =\displaystyle= (2rs2+1+1)(2rs1+1)(2r+22rs1+1+1).\displaystyle(2^{r-s_{2}+1}+1)\cdots(2^{r-s_{1}}+1)\big{(}2^{r+2}-2^{r-s_{1}+1}+1\big{)}. (5)

As s1<s2s_{1}<s_{2}, the right hand side is greater than 22r+2s12^{2r+2-s_{1}}, which is greater than 2r+12^{r+1} as s1<s2<g=r1s_{1}<s_{2}<g=r-1. Hence the right hand side is greater than the left, so they cannot be equal. Thus Γs1\Gamma_{s_{1}} and Γs2\Gamma_{s_{2}} are not isomorphic if s1s_{1} and s2s_{2} are distinct. \square

6.1 Kantor’s graphs

In [8], Kantor constructs a strongly regular graph ΓK\Gamma_{K} from a non-singular quadric 𝒬n\mathscr{Q}_{n} in PG(n,q){\rm PG}(n,q) with the same parameters as the point-graph Γ\Gamma of 𝒬n\mathscr{Q}_{n}. Kantor conjects that the graph ΓK\Gamma_{K} is not the same as Γ\Gamma except in the case when 𝒬n=7\mathscr{Q}_{n}=\mathcal{H}_{7}. It is not known in general whether ΓK\Gamma_{K} is isomorphic to ΓΓ0\Gamma\cong\Gamma_{0}. We show that ΓK\Gamma_{K} is not isomorphic to the graphs Γs\Gamma_{s} when s>0s>0. Kantor’s construction works when the quadric 𝒬n\mathscr{Q}_{n} contains a spread, however, we do not need to describe the details of Kantor’s graphs to prove non-isomorphism.

Theorem 6.3

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1. Let Γs\Gamma_{s}, 0<s<g0<s<g be the graph constructed in Theorem 3.3. Let ΓK\Gamma_{K} be the graph constructed from 𝒬n\mathscr{Q}_{n} in [8]. Then ΓK\Gamma_{K} is not isomorphic to Γs\Gamma_{s}, 0<s<g0<s<g.

Proof  We use [8, Lemma 3.3] which shows that the vertices of ΓK\Gamma_{K} can be partitioned into maximal cliques. We show that the vertices of Γs\Gamma_{s}, 0<s<g0<s<g, cannot be partitioned into maximal cliques. Let 𝒞,𝒞{\cal C},{\cal C}^{\prime} be two maximal cliques of Γs\Gamma_{s}. We consider three cases. If 𝒞,𝒞{\cal C},{\cal C}^{\prime} are both of Class A, then they both contain αs\alpha_{s}, and so are not disjoint. If 𝒞{\cal C} is Class A and 𝒞{\cal C}^{\prime} is Class B, then 𝒞{\cal C} contains αs\alpha_{s}, and 𝒞{\cal C}^{\prime} meets αs\alpha_{s} in a (s1)(s-1)-space. Hence as s>0s>0, 𝒞{\cal C}^{\prime} contains at least one point of αs\alpha_{s}, so 𝒞,𝒞{\cal C},{\cal C}^{\prime} are not disjoint in this case.

Now consider the case where 𝒞,𝒞{\cal C},{\cal C}^{\prime} are maximal cliques of Γs\Gamma_{s} of Class B. Both 𝒞,𝒞{\cal C},{\cal C}^{\prime} meet αs\alpha_{s} in a subspace of dimension s1s-1. If s2s\geq 2, then two subspaces of dimension s1s-1 contained in an ss-space meet in at least a point, and so 𝒞,𝒞{\cal C},{\cal C}^{\prime} share at least a point. Thus if s2s\geq 2, any two maximal cliques of Γs\Gamma_{s} share at least one vertex, and so the vertices of Γs\Gamma_{s} cannot be partition into maximal cliques, and hence Γs\Gamma_{s}, 2s<g2\leq s<g is not isomorphic to ΓK\Gamma_{K}.

Now suppose s=1s=1, so α1\alpha_{1} is a line. A partition of the vertices of Γ1\Gamma_{1} into maximal cliques partitions the points of α1\alpha_{1}. As every maximal clique of Γ1\Gamma_{1} contains a point of α1\alpha_{1}, we are looking for a partition of Γ1\Gamma_{1} into three maximal cliques of Class B, one through each point of α1\alpha_{1}. We show there is no such partition. First, a maximal clique has 2g+112^{g+1}-1 points, so three pairwise disjoint maximal cliques contain x=3(2g+11)x=3(2^{g+1}-1) points, with either g=r1g=r-1 or rr. As 0<s<g0<s<g, it follows that g2g\geq 2. Thus for the elliptic and parabolic case we have r3r\geq 3 and for the hyperbolic case we have r2r\geq 2. However, as q=2q=2, 2r+1{\cal E}_{2r+1} contains 22r+12r12^{2r+1}-2^{r}-1 points, 2r+1\mathcal{H}_{2r+1} contains 22r+1+2r12^{2r+1}+2^{r}-1 points and 𝒫2r\mathcal{P}_{2r} contains 22r12^{2r}-1 points. None of these numbers is equal to xx when r2r\geq 2. Hence we cannot partition the vertices of Γs\Gamma_{s}, s>0s>0 into maximal cliques. Thus by [8, Lemma 3.3], Γs\Gamma_{s} is not isomorphic to ΓK\Gamma_{K}. \square

7 The automorphism group of Γs\Gamma_{s}

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1. Let Γ\Gamma be the point-graph of 𝒬n\mathscr{Q}_{n}. Let αs\alpha_{s} be an ss-space contained in 𝒬n\mathscr{Q}_{n}, 0s<g0\leq s<g, construct the partition of the points of 𝒬n\mathscr{Q}_{n} given in Definition 3.2, and let Γs\Gamma_{s} be the graph constructed in Theorem 3.3. If s=0s=0, then by Theorem 6.1, Γ0=Γ\Gamma_{0}=\Gamma so Aut(Γ0)=AutΓ\operatorname{Aut}(\Gamma_{0})=\operatorname{Aut}\Gamma. In this section we determine the automorphism group of the graph Γs\Gamma_{s}, 0<s<g0<s<g.

First note that the group of collineations of PG(n,2){\rm PG}(n,2) fixing 𝒬n\mathscr{Q}_{n} is PGO(n+1,2){\rm PGO}(n+1,2), see [7]. Moreover, if n4n\geq 4, then the group of automorphisms of Γ\Gamma is AutΓPGO(n+1,2)\operatorname{Aut}\Gamma\cong{\rm PGO}(n+1,2), see [10, Chapter 8].

The partition of the points of 𝒬n\mathscr{Q}_{n} given in Definition 3.2 also partitions the vertices of Γ\Gamma and Γs\Gamma_{s}, 0s<g0\leq s<g. Vertices of type (i) in Γ\Gamma correspond in PG(n,2){\rm PG}(n,2) to the points of αs\alpha_{s}. Let (AutΓ)αs(\operatorname{Aut}\Gamma)_{\alpha_{s}} denote the subgroup of automorphisms of Γ\Gamma that fix the set of vertices of type (i). As the graphs Γ,Γs\Gamma,\Gamma_{s} have the same set of vertices, if ϕ\phi is a map acting on the vertices of Γ\Gamma, then ϕ\phi is also a map acting on the vertices of Γs\Gamma_{s}. We will prove the following relationship between their automorphism groups.

Theorem 7.1

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1 with point-graph Γ\Gamma. Let αs\alpha_{s} be an ss-space of 𝒬n\mathscr{Q}_{n}, 0<s<g0<s<g, and let Γs\Gamma_{s} be the graph constructed in Theorem 3.3. Then Aut(Γs)=(AutΓ)αs\operatorname{Aut}(\Gamma_{s})=(\operatorname{Aut}\Gamma)_{\alpha_{s}}.

In order to prove this theorem, we need a series of preliminary lemmas, the first relies on an application of Witt’s Theorem, so we begin with a discussion on applying Witt’s Theorem to non-singular quadrics of PG(n,2){\rm PG}(n,2), see [9, Chapter 7] for more details. Let VV be a vector space of dimension n+1n+1 over GF(2){\rm GF}(2), and let f(x0,,xn)f(x_{0},\ldots,x_{n}) be a quadratic form on VV with associated bilinear form b(x,y)=b(x+y)b(x)b(y)b(x,y)=b(x+y)-b(x)-b(y). The radical of ff in VV is the subspace radf={uV:b(u,v)=0forallvV}\operatorname{rad}f=\{u\in V:b(u,v)=0{\rm\ for\ all\ }v\in V\}. Let UU be a subspace of VV and suppose there exists a linear isometry φ:UV\varphi\colon U\rightarrow V with respect to ff (that is, φ\varphi is an invertible linear map and f(u)=f(φ(u))f(u)=f(\varphi(u)) for all uUu\in U. Then Witt’s theorem says that there exists a linear isometry ζ:VV\zeta\colon V\rightarrow V such that ζ(u)=φ(u)\zeta(u)=\varphi(u) for all uUu\in U if and only if φ(Uradf)=φ(U)radf\varphi(U\cap\operatorname{rad}f)=\varphi(U)\cap\operatorname{rad}f. We interpret this in the projective space PG(n,2){\rm PG}(n,2) associated with VV. Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) with homogeneous equation f(x0,,xn)=0f(x_{0},\ldots,x_{n})=0. If nn is odd, then radf=\operatorname{rad}f=\emptyset. If nn is even, then 𝒬n=𝒫n\mathscr{Q}_{n}=\mathcal{P}_{n} and radf\operatorname{rad}f is the nucleus point NN of 𝒫n\mathcal{P}_{n}. As an example, let Π1,Π2\Pi_{1},\Pi_{2} be subspaces of 𝒬n\mathscr{Q}_{n} of the same dimension. If 𝒬n\mathscr{Q}_{n} has a nucleus NN, then N𝒬nN\notin\mathscr{Q}_{n}, so neither Π1\Pi_{1} nor Π2\Pi_{2} contain NN. As there exists a collineation of PG(n,2){\rm PG}(n,2) that maps Π1\Pi_{1} to Π2\Pi_{2}, it follows from Witt’s theorem that there exists a collineation of PG(n,2){\rm PG}(n,2) that fixes 𝒬n\mathscr{Q}_{n} and maps Π1\Pi_{1} to Π2\Pi_{2}. We use Witt’s Theorem to prove the following lemma.

Lemma 7.2

Let 𝒬n\mathscr{Q}_{n} be a non-singular quadric in PG(n,2){\rm PG}(n,2) of projective index g1g\geq 1. Let ss be an integer, 0s<g0\leq s<g, let αs\alpha_{s} be an ss-space of 𝒬n\mathscr{Q}_{n}, and partition the points of 𝒬n\mathscr{Q}_{n} into types (i), (ii), (iii) as in Definition 3.2. Then the subgroup of PGO(n+1,2){\rm PGO}(n+1,2) fixing αs\alpha_{s} is transitive on the points of each type.

Proof  Let P,PP,P^{\prime} be two points of 𝒬n\mathscr{Q}_{n} of type (i), so P,PαsP,P^{\prime}\in\alpha_{s}. There is a collineation of PG(n,2){\rm PG}(n,2) that fixes αs\alpha_{s}, and maps PP to PP^{\prime}. Hence by Witt’s theorem, there is a collineation of PG(n,2){\rm PG}(n,2) fixing αs\alpha_{s} and 𝒬n\mathscr{Q}_{n}, and mapping PP to PP^{\prime}. Hence PGO(n+1,2)αs{\rm PGO}(n+1,2)_{\alpha_{s}} is transitive on the points of 𝒬n\mathscr{Q}_{n} of type (i).

Let Q,QQ,Q^{\prime} be points of 𝒬n\mathscr{Q}_{n} of type (ii), so Π=Q,αs\Pi=\langle Q,\alpha_{s}\rangle and Π=Q,αs\Pi^{\prime}=\langle Q^{\prime},\alpha_{s}\rangle are (s+1)(s+1)-spaces contained in 𝒬n\mathscr{Q}_{n}. There is a collineation of PG(n,2){\rm PG}(n,2) that maps Π\Pi to Π\Pi^{\prime}, fixes αs\alpha_{s}, and maps QQ to QQ^{\prime}. Hence by Witt’s Theorem, there is a collineation of PG(n,2){\rm PG}(n,2) that fixes αs\alpha_{s} and 𝒬n\mathscr{Q}_{n}, and maps QQ to QQ^{\prime}. Hence PGO(n+1,2)αs{\rm PGO}(n+1,2)_{\alpha_{s}} is transitive on the points of 𝒬n\mathscr{Q}_{n} of type (ii).

Let R,RR,R^{\prime} be points of 𝒬n\mathscr{Q}_{n} of type (iii), so Π=R,αs\Pi=\langle R,\alpha_{s}\rangle and Π=R,αs\Pi^{\prime}=\langle R^{\prime},\alpha_{s}\rangle are (s+1)(s+1)-spaces which are not contained in 𝒬n\mathscr{Q}_{n}. Now Π\Pi is an (s+1)(s+1)-space, and Π𝒬n\Pi\cap\mathscr{Q}_{n} contains αs\alpha_{s} and the point RαsR\notin\alpha_{s}, hence by Result 2.2, Π𝒬n\Pi\cap\mathscr{Q}_{n} is exactly two ss-spaces. Similarly, Π𝒬n\Pi^{\prime}\cap\mathscr{Q}_{n} is two ss-spaces, one being αs\alpha_{s}. So there is an automorphism of PG(n,2){\rm PG}(n,2) that maps Π\Pi to Π\Pi^{\prime}, fixes αs\alpha_{s}, and maps RR to RR^{\prime}. As Π,Π\Pi,\Pi^{\prime} are not contained in 𝒬n\mathscr{Q}_{n}, in order to apply Witt’s Theorem, we need to consider the nucleus NN of 𝒬n\mathscr{Q}_{n} when nn is even. Suppose nn is even, so 𝒬n=𝒫n\mathscr{Q}_{n}=\mathcal{P}_{n}, and 𝒫n\mathcal{P}_{n} has nucleus a point N𝒫nN\notin\mathcal{P}_{n}. We show that neither Π\Pi nor Π\Pi^{\prime} contain NN. Let Pαs𝒫nP\in\alpha_{s}\subset\mathcal{P}_{n} and let ΣP\Sigma_{P} be the tangent hyperplane to 𝒫n\mathcal{P}_{n} at PP. So ΣP\Sigma_{P} contains NN and all the lines of 𝒫n\mathcal{P}_{n} through PP. Let Σ=PαsΣP\Sigma=\cap_{P\in\alpha_{s}}\Sigma_{P}, then Σ\Sigma contains NN and points of type (i) and (ii), but no points of type (iii). As αs,N\langle\alpha_{s},N\rangle is an (s+1)(s+1)-space contained in Σ\Sigma, it contains no points of type (iii). As the (s+1)(s+1)-space Π\Pi contains points of type (iii), Π\Pi meets αs,N\langle\alpha_{s},N\rangle in exactly the ss-space αs\alpha_{s}. Thus NΠN\notin\Pi, and similarly NΠN\notin\Pi^{\prime}. Hence by Witt’s Theorem there is a collineation of PG(n,2){\rm PG}(n,2) that fixes αs\alpha_{s} and 𝒬n\mathscr{Q}_{n}, and maps RR to RR^{\prime}. Thus PGO(n+1,2)αs{\rm PGO}(n+1,2)_{\alpha_{s}} is transitive on the points of 𝒬n\mathscr{Q}_{n} of type (iii). \square

We now show that if s>0s>0, then Aut(Γs)\operatorname{Aut}(\Gamma_{s}) has at least three orbits on the vertices of Γs\Gamma_{s}, namely the vertices of each type.

Lemma 7.3

For 0<s<g0<s<g, the vertices of Γs\Gamma_{s} of different types lie in a different number of maximal cliques.

Proof  We prove the result for the case 𝒬n=2r+1\mathscr{Q}_{n}={\cal E}_{2r+1}, the cases when 𝒬n\mathscr{Q}_{n} is 2r+1\mathcal{H}_{2r+1} and 𝒫2r\mathcal{P}_{2r} are similar. Comparing the number of cliques through vertices of type (i), (ii) and (iii) in Γs\Gamma_{s} from Theorem 5.8, it is sufficient to show that k!,k2,k3k_{!},k_{2},k_{3} are distinct where

k1=(2rs+1)(2r+12rs+1+1),k2=2r+12rs+1,k3=2rs+1.k_{1}=(2^{r-s}+1)(2^{r+1}-2^{r-s+1}+1),\quad k_{2}=2^{r+1}-2^{r-s}+1,\quad k_{3}=2^{r-s}+1.

If 0<s<g10<s<g-1, then k1k2=2rs(2r+12rs+1)>0k_{1}-k_{2}=2^{r-s}(2^{r+1}-2^{r-s+1})>0 and k2k3=2r+12rs+1>0k_{2}-k_{3}=2^{r+1}-2^{r-s+1}>0. Hence k1>k2>k3k_{1}>k_{2}>k_{3}, that is vertices of different types lie in a different number of maximal cliques. If 0<s=g10<s=g-1, then r3r\geq 3 and so k1,k2,k3k_{1},k_{2},k_{3} are distinct.

\square

Lemma 7.4

If 0<s<g0<s<g, then (AutΓ)αsAut(Γs)(\operatorname{Aut}\Gamma)_{\alpha_{s}}\subseteq\operatorname{Aut}(\Gamma_{s}). Further, Aut(Γs)\operatorname{Aut}(\Gamma_{s}) has exactly three orbits on the vertices of Γs\Gamma_{s}, namely the vertices of each type.

Proof  Recall that Γ\Gamma is the point-graph of a non-singular quadric 𝒬n\mathscr{Q}_{n} in PG(n,2){\rm PG}(n,2) with projective index g1g\geq 1; αs\alpha_{s} is an ss-space contained in 𝒬n\mathscr{Q}_{n}; and the vertices of Γ\Gamma are partitioned into types (i), (ii) and (iii) as given in Definition 3.2. Note that as 0<s<g0<s<g, we need g>1g>1, and so n5n\geq 5.

Let ϕ(AutΓ)αs\phi\in(\operatorname{Aut}\Gamma)_{\alpha_{s}}, so ϕ\phi is an automorphism of Γ\Gamma that fixes the set of vertices of Γ\Gamma of type (i). As Γ,Γs\Gamma,\Gamma_{s} have the same set of vertices, ϕ\phi acts on the vertices of Γs\Gamma_{s}, and fixes the set of vertices of Γs\Gamma_{s} of type (i). Further, ϕ\phi induces a bijection denoted ϕ¯\bar{\phi} acting on the points of 𝒬n\mathscr{Q}_{n} and fixing αs\alpha_{s}. As n5n\geq 5, we have AutΓPGO(n+1,2)\operatorname{Aut}\Gamma\cong{\rm PGO}(n+1,2) (see [10, Chapter 8]) so ϕ¯PGO(n+1,2)αs\bar{\phi}\in{\rm PGO}(n+1,2)_{\alpha_{s}}. By Lemma 7.2, ϕ¯\bar{\phi} preserves the type of a point in 𝒬n\mathscr{Q}_{n}, hence ϕ\phi preserves the type of a vertex in Γs\Gamma_{s}. By Corollary 4.5, the edges of Γs\Gamma_{s} are described in Table 1. As the collineation ϕ¯\bar{\phi} maps lines (respectively 2-secants) of 𝒬n\mathscr{Q}_{n} to lines (2-secants) of 𝒬n\mathscr{Q}_{n}, the map ϕ\phi preserves adjacencies and non-adjacencies of vertex pairs of Γs\Gamma_{s}. That is ϕAut(Γs)\phi\in\operatorname{Aut}(\Gamma_{s}), and so (AutΓ)αsAut(Γs)(\operatorname{Aut}\Gamma)_{\alpha_{s}}\subseteq\operatorname{Aut}(\Gamma_{s}).

Further, by Lemma 7.2, PGO(n,2)αs{\rm PGO}(n,2)_{\alpha_{s}} is transitive on the points of 𝒬n\mathscr{Q}_{n} of each type, so (AutΓ)αs(\operatorname{Aut}\Gamma)_{\alpha_{s}} is transitive on the vertices of Γ\Gamma of each type. Hence Aut(Γs)\operatorname{Aut}(\Gamma_{s}) has at most three orbits on the vertices of Γs\Gamma_{s}. By Lemma 7.3, Aut(Γs)\operatorname{Aut}(\Gamma_{s}) has at least three orbits on the vertices of Γs\Gamma_{s}. Hence Aut(Γs)\operatorname{Aut}(\Gamma_{s}) has exactly three orbits on the vertices of Γs\Gamma_{s}, namely the vertices of each type. \square

Lemma 7.5

For 0s<g0\leq s<g, Aut(Γs)AutΓ\operatorname{Aut}(\Gamma_{s})\subseteq\operatorname{Aut}\Gamma.

Proof  First note that if s=0s=0, then by Theorem 6.1, Γ0=Γ\Gamma_{0}=\Gamma so Aut(Γ0)=AutΓ\operatorname{Aut}(\Gamma_{0})=\operatorname{Aut}\Gamma. Suppose s>0s>0, and let ϕAut(Γs)\phi\in\operatorname{Aut}(\Gamma_{s}). As Γ\Gamma and Γs\Gamma_{s} have the same set of vertices, ϕ\phi is a bijection acting on the vertices of Γ\Gamma. We show that ϕ\phi preserves adjacencies and non-adjacencies of vertices in Γ\Gamma.

By Corollary 4.5 and Table 1, the only difference in adjacencies between vertices in Γ\Gamma and Γs\Gamma_{s} are between a vertex of type (ii) and a vertex of type (iii). Let X,YX,Y be two vertices of Γ\Gamma, there are two cases to consider. Firstly, if the pair X,YX,Y consists of one vertex of type (ii) and one vertex of type (iii), then X,YX,Y are adjacent in Γ\Gamma if and only if X,YX,Y are non-adjacent in Γs\Gamma_{s}. Secondly, if the pair X,YX,Y does not consist of one vertex of type (ii) and one vertex of type (iii), then X,YX,Y are adjacent in Γ\Gamma if and only if X,YX,Y are adjacent in Γs\Gamma_{s}. In either case, as ϕ\phi preserves adjacency and non-adjacency in Γs\Gamma_{s}, ϕ\phi preserves the adjacency or non-adjacency of the vertex pair X,YX,Y in Γ\Gamma. Hence ϕAutΓ\phi\in\operatorname{Aut}\Gamma as required. \square

Proof of Theorem 7.1  By Lemma 7.5, Aut(Γs)AutΓ\operatorname{Aut}(\Gamma_{s})\subseteq\operatorname{Aut}\Gamma, and so (Aut(Γs))αs(AutΓ)αs(\operatorname{Aut}(\Gamma_{s}))_{\alpha_{s}}\subseteq(\operatorname{Aut}\Gamma)_{\alpha_{s}}. As s>0s>0, by Lemma 7.4, Aut(Γs)\operatorname{Aut}(\Gamma_{s}) fixes the set of vertices of type (i), that is (Aut(Γs))αs=Aut(Γs)(\operatorname{Aut}(\Gamma_{s}))_{\alpha_{s}}=\operatorname{Aut}(\Gamma_{s}), hence Aut(Γs)(AutΓ)αs\operatorname{Aut}(\Gamma_{s})\subseteq(\operatorname{Aut}\Gamma)_{\alpha_{s}}. By Lemma 7.4, (AutΓ)αsAut(Γs)(\operatorname{Aut}\Gamma)_{\alpha_{s}}\subseteq\operatorname{Aut}(\Gamma_{s}), hence (AutΓ)αs=Aut(Γs)(\operatorname{Aut}\Gamma)_{\alpha_{s}}=\operatorname{Aut}(\Gamma_{s}) as required. \square

Finally we show that given a graph Γs\Gamma_{s}, we can reconstruct the graph Γ\Gamma and the quadric 𝒬n\mathscr{Q}_{n}. If s=0s=0 then Γ=Γ0\Gamma=\Gamma_{0} by Theorem 6.1. So suppose 0<s<g0<s<g, and define a graph Γ\Gamma whose vertices are the vertices of Γs\Gamma_{s}. The proof of Lemma 7.3 shows that the number of maximal cliques through a vertex of Γs\Gamma_{s} of type (i) is greater than the number of maximal cliques through a vertex of type (ii), which is greater than the number of maximal cliques through a vertex of type (iii). Hence we can partition the vertices of Γs\Gamma_{s} into their types by using the number of maximal cliques through them. Define the edges of Γ\Gamma to be the same as the edges of Γs\Gamma_{s}, except swapping the adjacencies between vertices of type (ii) and (iii). Then by Corollary 4.5, Γ\Gamma is the point-graph of the quadric 𝒬n\mathscr{Q}_{n} used to construct Γs\Gamma_{s}. We can now reconstruct the quadric 𝒬n\mathscr{Q}_{n} from Γ\Gamma as follows. The maximal cliques of Γ\Gamma are exactly the generators of 𝒬n\mathscr{Q}_{n} in PG(n,2){\rm PG}(n,2). By intersecting the generators of 𝒬n\mathscr{Q}_{n}, we can recover firstly the (g1)(g-1)-spaces of 𝒬n\mathscr{Q}_{n}, and so on, constructing the lattice of subspaces of the generators. Hence we can construct the points of 𝒬n\mathscr{Q}_{n}, all the lines contained in 𝒬n\mathscr{Q}_{n}, the planes contained in 𝒬n\mathscr{Q}_{n}, …, the gg-spaces contained in 𝒬n\mathscr{Q}_{n}.

8 Conclusion

In summary, Table 3 lists the parameters of the strongly regular graphs arising from the point-graph of each type of non-singular quadric. Further, we list the number of new non-isomorphic graphs with these parameters arising from our construction (that is, not including Γ0=Γ\Gamma_{0}=\Gamma).

Table 3: Parameters of the strongly regular graphs Γs\Gamma_{s}, 0s<g0\leq s<g
quadric 2r+1{\cal E}_{2r+1}, r2r\geq 2 2r+1\mathcal{H}_{2r+1}, r1r\geq 1 𝒫2r\mathcal{P}_{2r}, r2r\geq 2
vv 22r+12r12^{2r+1}-2^{r}-1 22r+1+2r12^{2r+1}+2^{r}-1 22r12^{2r}-1
kk 22r2r22^{2r}-2^{r}-2 22r+2r22^{2r}+2^{r}-2 22r122^{2r-1}-2
λ\lambda 22r12r32^{2r-1}-2^{r}-3 22r1+2r32^{2r-1}+2^{r}-3 22r232^{2r-2}-3
μ\mu 22r12r112^{2r-1}-2^{r-1}-1 22r1+2r112^{2r-1}+2^{r-1}-1 22r212^{2r-2}-1
number of new non-isomorphic graphs r2r-2 r1r-1 r2r-2

References

  • [1] A. Abiad and W.H. Haemers. Switched symplectic graphs and their 2-ranks. http://arxiv.org/pdf/1412.2945v1.pdf
  • [2] W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system. I. The user language, J. Symbolic Comput., 24 (1997), 235–265.
  • [3] A. E. Brouwer, A. M. Cohen and A. Neumaier. Distance-regular graphs. Ergebnisse der Mathematik 3.18, Springer, Heidelberg, 1989.
  • [4] A. E. Brouwer and W. H. Haemers. Spectra of graphs. Springer, 2012.
  • [5] C. D. Godsil and B. D. McKay. Constructing cospectral graphs. Aequationes Math., 25 (1982) 257–268.
  • [6] J. W. P. Hirschfeld. Projective Geometry over Finite Fields, Second Edition. Oxford University Press, 1998.
  • [7] J. W. P. Hirschfeld and J. A. Thas. General Galois Geometries. Oxford University Press, 1991.
  • [8] W. M. Kantor. Strongly regular graphs defined by spreads. Israel J. Math., 41 (1982) 298–312.
  • [9] D. E. Taylor. The geometry of the classical groups, Sigma series in pure mathematics, Heldermann Verlag, 1992.
  • [10] J. Tits. Buildings of spherical type and finite BN-pairs, Lecture Notes in Mathematics 386, Springer-Verlag, 1974.