New families of strongly regular graphs
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 .
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, is a graph with vertices such that each vertex lies on edges; any two adjacent vertices have exactly common neighbours; and any two non-adjacent vertices have exactly common neighbours. We consider the strongly regular graphs constructed from a non-singular quadric in . The point-graph of has vertices corresponding to the points of . Two vertices in are adjacent if the corresponding points of lie on a line contained in . It is well known (see for example [3]) that is a strongly regular graph. In this article we let , and construct from approximately new strongly regular graphs with the same parameters as (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 with the same parameters in the case when contains a spread. Kantor conjects that his graph is not isomorphic to . 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 . The dual of these graphs have the same parameters as the point-graph of a non-singular parabolic quadric, so is even. It is not known if these graphs are isomorphic to our examples with even.
2 Background Results
In [5], Godsil and McKay take a graph , and use a vertex partition to construct a new graph that has the same spectrum as . It is well-known (see for example [4]) that if a graph has the same spectrum as a strongly regular graph , then is also strongly regular with the same parameters as . Specialising the Godsil-McKay construction to a partition of size two in a strongly regular graph gives the following result.
Result 2.1
-
1.
A Godsil-McKay partition of a graph is a partition of the vertices into two sets satisfying:
-
I.
The set induces a regular subgraph.
-
II.
Each vertex in is adjacent to , or vertices in .
-
I.
-
2.
Godsil-McKay construction. Let be a strongly regular graph with Godsil-McKay partition . Construct the graph with the same points and edges as , except: for each vertex in with neighbours in , delete these edges and join to the other vertices in . Then the graph is strongly regular with the same parameters as .
Let be a non-singular quadric in . The projective index of is the dimension of the largest subspace contained in . A -space contained in is called a generator of . If is even, then a non-singular quadric is called a parabolic quadric, denoted , which has projective index . If is odd, then there are two types of non-singular quadrics: the elliptic quadric denoted has projective index ; and the hyperbolic quadric denoted has projective index . The points and generators of also form a polar space of rank . 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 be a non-singular quadric in and let be a -space. If the quadric contains a -space, then is either , or one or two -spaces.
Result 2.3
Let be a non-singular quadric in , with projective index . Let be a generator of , and a point of not in . Then there is a unique generator of that contains and meets in a -space. Further, the points in which lie on a line of through are exactly the points in .
3 Our construction
We begin with a small example to illustrate the general construction.
Example 3.1
Let be a line of the elliptic quadric in . Partition the points of into the following three types.
-
(i)
points of on ,
-
(ii)
points of that are on a plane of that contains ,
-
(iii)
the remaining points of .
Define a new graph with vertices the points of , and edges given in Table 1.
| Vertex pair | Vertex types | Vertex pair is an edge of : |
|---|---|---|
| are type (i) | always (as is always a line of ) | |
| is type (i), is type (ii) | always (as is always a line of ) | |
| are type (ii) | when is a line of | |
| is type (i), is type (iii) | when is a line of | |
| are type (iii) | when is a line of | |
| is type (ii), is type (iii) | when is a -secant of |
Note that the last row of Table 1 describes the edges of that are different to the edges of the point-graph of .
It can be shown directly using geometric techniques that is regular if and only if , and that in this case is strongly regular with the same parameters as . This can also be proved using the Godsil-McKay construction as follows. Consider the partition of where contains the vertices of type (ii), and 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 . Note that the graph constructed in Result 2.1(2) from this partition is the graph , hence is strongly regular when .
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 .
Definition 3.2
Let be a non-singular quadric in , and let be the point-graph of . Let be an integer with , where is the projective index of . Let be an -dimensional subspace contained in . The points of (and so the vertices of ) can be partitioned into three types:
-
(i)
points in ,
-
(ii)
points of that lie in some -dimensional subspace with ,
-
(iii)
the remaining points of .
Let be the vertices of of type (ii) and let be the vertices of of type (i) and (iii).
Note that if , then there are no points of type (ii), so we need . We will show that the partition , , is a Godsil-McKay partition if and only if . By [7, Theorem 26.6.6], the group fixing is transitive on the subspaces of dimension contained in . So for each , , we can use Result 2.1 to construct a unique strongly regular graph from . We state the main result here, and give the proof in Section 4.
Theorem 3.3
In , let be a non-singular quadric of projective index with point-graph . For each integer , , let be the graph obtained using the Godsil-McKay construction with the partition defined in Definition 3.2. Then is a strongly regular graph with the same parameters as .
We show in Section 6 that , and that for each , , are non-isomorphic graphs.
4 Proof of Theorem 3.3
Throughout this section, let be a non-singular quadric in of projective index , and let be a subspace of dimension , , contained in . Let be the point-graph of , and let be the partition of the vertices of (and so of the points of ) defined in Definition 3.2. We will show that satisfies Conditions I and II of Result 2.1. First we count the points in .
Lemma 4.1
-
1.
If , then .
-
2.
If , then .
-
3.
If , then .
Proof We prove this in the case is , which has projective index and point-graph denoted . The cases when is and are proved in a very similar manner.
By [7, Theorem 22.5.1], the number of subspaces of dimension contained in is
Moreover, replacing ‘’ by ‘’ in this equation gives the number of subspaces of dimension contained in . By [6, Theorem 3.1], the number of subspaces of dimension in a subspace of dimension is . By [7], the number of subspaces of dimension that contain and are contained in is a constant. To calculate it, we count ordered pairs where is an -dimensional subspace contained in , is an -dimensional subspace contained in , and . This count gives the number of subspaces of dimension that contain and are contained in is
| (1) |
Each of these subspace contains points that are not in . Hence as required.
We now show that satisfies Condition I of Result 2.1.
Lemma 4.2
Let be the subgraph of on the vertices in . Then is a regular graph with degree where:
-
1.
if , then ;
-
2.
if , then ;
-
3.
if , then
Proof We prove this in the case is , which has projective index and point-graph denoted . The cases when is and are proved in a very similar manner.
Let be a vertex in , we need to count the number of vertices in that are adjacent to . Recall that consists of vertices of type (ii), so in , is a point of the quadric , and the -dimensional space is contained in . A vertex in is adjacent to if the line is contained in . We partition the lines of through into three families: contains the lines of through that lie in ; contains the lines of through (not in ) that lie in an -dimensional subspace that contains and is contained in ; and contains the remaining lines of through .
We first look at . The number of lines in equals the number of lines through a point in an -dimensional subspace, so by [6, Theorem 3.1],
| (2) |
Each of the lines in contains the point and meets in one point. So each line in gives rise to vertices in which are adjacent to in the graph . In total, contributes neighbours of in .
Next we look at . Replacing ‘’ by ‘’ in (1) gives the number of subspace of dimension that contain the -space and are contained in is . Similarly, (2) can be generalised to show that the number of lines through that lie in a subspace of dimension , and do not lie in the -space is . Hence
Each line in contains one point of , and the remaining points correspond to vertices that lie in (and are not considered in ). That is, each line in contributes neighbours to in the graph . So in total, contributes neighbours to in the graph .
Finally we look at . Let be a line in , so contains , but the -space is not contained in . Suppose that contains another point that corresponds to a vertex in . Then contains the two distinct -dimensional subspaces and . As is not contained in , meets in exactly the two -spaces and . Thus is not a line of , and so contains exactly two points that are vertices of , moreover they are not adjacent in . Thus contributes 0 neighbours to in the graph .
Summing the neighbours of in obtained from the families gives the required result. Note that if , so , then , and the degree of is .
Now we look at Condition II of Result 2.1. Note that throughout the proofs in this article, we consistently use to denote points of type (i); to denote points of type (ii); and to denote points of type (iii).
Lemma 4.3
The partition satisfies Condition II of Result 2.1 if and only if .
Proof We prove this in the case is , which has projective index and point-graph denoted . The cases when is and are proved in a very similar manner.
We need to show that in the graph , each vertex in is adjacent to , or vertices in . There are two cases to consider since the vertices in are of type (i) or (iii). First consider a vertex in of type (i). Let , so is a vertex of type (ii). Hence in , and lies in an -space with . Hence is a line of , and so and are adjacent vertices in . That is, each vertex of type (i) in is adjacent to each of the vertices in .
Now consider a vertex in of type (iii). We count the number of vertices in for which is a line of . We will show that this number is not 0 or , and further, is if and only if . Let be a subspace of of dimension that contains . So consists of points of type (ii), hence . Consider the -space . As , we have . As is of type (iii), is not contained in . Hence is not contained in . So contains the -space and the point . Hence by Result 2.2, is two distinct -spaces. That is, where is an -space that contains . As is type (iii), does not contain . Hence is an -space distinct from , and so is a space of dimension . Let be a point in , , so has type (ii). As , the line is a line of .
Suppose the line contains a second point of type (ii). So is an -space contained in . Thus contains three distinct -spaces of , namely , contradicting Result 2.2. Thus contains exactly one point of type (ii), namely , and the rest of the points on are type (iii). Hence in the graph , the line gives rise to one neighbour of that lies in , namely . Thus each point of not in gives rise to exactly one vertex in that is a neighbour of . This is true for every -space with . Moreover, each neighbour of in corresponds to a point of that lies in exactly one such -space, so arises exactly once in this way. Hence the number of neighbours of that lie in equals the number of points of that lie in an -space with . We count these points.
Firstly, the number of -dimensional spaces that contain and are contained in is given in (1). Secondly, let be an -space containing , and an -space that meets in an -space not containing . Then the number of points in which are not in is . Hence in the graph , there are
vertices in that are neighbours of . To satisfy Condition II of Result 2.1, we need . Now if and only if , which does not occur as . Further, is calculated in Lemma 4.1, and . Using Lemma 4.1, if and only if .
Thus the vertices in of type (i) are adjacent to of the vertices in . Further, the vertices in of type (iii) are not adjacent to 0 or all the vertices of , and are adjacent to of the vertices in if and only if . That is, Condition II of Result 2.1 is satisfied in for the partition of if and only if .
It is now straightforward to prove Theorem 3.3.
Proof of Theorem 3.3 Let be a non-singular quadric of with projective index . Let be an integer with , let be a -space contained in , and let be the partition given in Definition 3.2. By Lemmas 4.2 and 4.3, the partition satisfies Conditions I and II of Result 2.1(1). Hence we can use Result 2.1(2) to construct a graph . Note that as the group fixing is transitive on the -spaces of , , different choices of the subspace give rise to the same (up to isomorphism) graph. So for any , , the graph is a strongly regular graph with the same parameters as .
Remark 4.4
As , we have . This places a bound on : when is a hyperbolic quadric, we need ; when is a parabolic quadric, we need ; and when is an elliptic quadric, we need .
It is useful to note that the proof of Lemma 4.3 gives a description of the edges in the graph . That is, let be vertices of type (i), vertices of type (ii), and vertices of type (iii). Then , , , , are edges of if , , , , are lines of respectively; and is an edge of if is a 2-secant of . In summary, we have:
Corollary 4.5
Remark 4.6
We note that if , then geometric techniques similar to those used here show that the graph with is not regular.
5 Maximal cliques of
5.1 Description of Maximal Cliques of
Throughout this section, let be a non-singular quadric of of projective index with point-graph . For an integer with , let be an -space of . Let be the graph described in Theorem 3.3.
We first describe the maximal cliques of the point-graph of . The largest subspaces contained in are the generators, which have dimension , and so contain points. Further, any subspace of is contained in a generator of . Hence the maximal cliques of have vertices and correspond to generators of .
We want to study maximal cliques in , we begin by studying cliques of of size , then show that these are maximal. We define a -clique of to be a clique of size . The next lemma describes two types of -cliques of , we show later that these are the maximal cliques of . The first type corresponds to generators of containing , and so corresponds to maximal cliques of the original graph . Figure 1 illustrates the two types of -cliques described in Lemma 5.1.
Lemma 5.1
Let , , be the graph constructed as in Theorem 3.3.
-
A.
Let be a generator of that contains , then the points of form a -clique of .
-
B.
Let be two generators of such that: contains ; does not contain ; and , meet in a -dimensional space. Let be the points of ; be the points of that are not in or ; and be the points of , see Figure 1. Then the points in form a -clique of the graph .
Proof For part A, let be a generator of that contains . Let be the set of vertices of that correspond to the points of . As consists of vertices of type (i) and (ii) only, two vertices of are adjacent if the corresponding two points lie on a line of . As is contained in , every pair of distinct points in lie in a line of . Hence every pair of distinct vertices in are adjacent, so is a clique. Further, contains points, so . Thus is a -clique of .
We now consider the set described in part B. By construction, the three sets are pairwise disjoint, consists of points of type (i), consists of points of type (ii), and contains no points of type (i). Suppose contained a point of type (ii), so is an -space of . By construction, is not contained in or , so contains a point not in or . So the -space meets in at least , contradicting Result 2.2. Hence consists of points of type (iii). Note that straightforward counting shows that the number of points in is as stated in the theorem, and .
We need to show that any pair of vertices in the set corresponding to are adjacent. Recall Corollary 4.5 shows that the adjacencies in are as described in Table 1. Let , , be distinct points. (Note that the argument below is easily adjusted to work if or has size 1.) As have type (i), have type (ii) and have type (iii), the following pairs of points lie in a subspace of , and so lie on a line of : , , , , . Hence the corresponding pairs of vertices are all adjacent in .
To complete the proof that corresponds to a -clique of , we need to show that are adjacent in , so by Table 1, we need to show that is a 2-secant of . The line lies in the -space , which meets in exactly and . As and , the line is not contained in , so it is a 2-secant of . Hence is an edge of . That is, is a set of vertices of such that any two vertices are adjacent, and so it is a -clique of .
We will show that the only maximal cliques in are the -cliques of Class A and B. We need some preliminary lemmas. Note that the -cliques of Class A contain no points of type (iii), we begin by showing that the converse also holds.
Lemma 5.2
Let be a -clique of , , that contains no vertices of type (iii), then is a -clique of Class A.
Proof Let be a -clique of , , that contains no vertices of type (iii). Suppose is not contained in a generator of . We consider the number of points of in each generator of . Let be a generator of that contains the maximum number of points of . As is not contained in , there is a point of that is not in . By Result 2.3, there is a unique generator of that contains and meets in a -space. Further, the points of that lie on a line of through are exactly the points of . As contains no points of type (iii), edges in correspond to lines of . In , each vertex in is adjacent to the vertex , so in , the points of lie in . Hence , which contradicts the choice of being the generator with the largest intersection with . Hence is contained in a generator of . As , the vertices of correspond exactly to the points of this generator, and so is a Class A -clique.
Lemma 5.3
Every generator of contains at least one point of type (ii).
Proof Let be a non-singular quadric of projective index and let be a generator of . There are two cases to consider. Firstly, if contains , then contains only points of type (i) and (ii). Hence, as , contains at least one point of type (ii). Next consider the case where meets in a subspace of dimension , with . Let be a point of . As , by Result 2.3 there exists a unique generator of that contains and meets in a -space. Moreover, if , then and so is a line of , hence by Result 2.3, , and so . Further, if is a point of not in and , then the line lies in and so is a line of .
If , we repeat this process. Let be a point of not in . By Result 2.3 there is a generator of that contains and meets in a -space. Moreover, if , then , and so is a line of , hence by Result 2.3, . So , and . Note that has dimension at least . Further, if is a point of not in , and , then lies in and so is a line of .
Repeat this process a total of times, until . Let , so has dimension , , and . Note that , so is non-empty. Let be a point of not in , and let . So , hence is a line of . That is, is an -space of and hence is a type (ii) point. As , contains at least one point of type (ii) as required.
We now show that there are only two types of -cliques in , namely those of Class A and B described in Lemma 5.1.
Lemma 5.4
Let be a -clique in , , then is a -clique of Class A or B.
Proof Let be a -clique of and denote the subsets of vertices of of type (i), (ii), (iii) by , , respectively. If , then by Lemma 5.2, corresponds to a generator of containing , and so is of Class A. So suppose .
We begin by constructing two generators of whose union contains the -clique . Firstly, as is a clique of , the subset is also a clique, so any two vertices of are adjacent in . As contains only vertices of type (i) and (iii), in , any two points of lie on a line of . Hence is a subspace of and so by [7, Theorem 22.4.1] is contained in a generator of . Secondly, consider the set of points in . Let , so has type (ii), and is contained in . Hence is a subspace of and so is contained in a generator of . So we have . To show that is a clique of Class B, we need to show that has dimension .
We first show that is not empty. Suppose , then is contained in the -space . As , we have . However, by Lemma 5.3, contains at least one point of type (ii), a contradiction. Thus .
As are not empty, let and . As lie in a clique of , they are adjacent in . Hence by Corollary 4.5, is a 2-secant of . As and is a 2-secant, we have . Similarly and a 2-secant implies . In summary, we have
Next we determine the size of , and . As , there is a point , so . By Result 2.3, there is a unique generator of that contains and meets in a -space denoted . There are two cases to consider as has dimension or . If contained , then would be a subspace of , which implies that is type (ii), a contradiction. Thus is an -space. If , then , so are adjacent in and so is a line of . Thus , and so . Thus , and so . By the construction of , each point in lies on a line of with , and each point of lies on a 2-secant of with . So the type (ii) points of are contained in . That is, .
As , there is a point , so . By Result 2.3, there is a unique generator of that contains and meets in a -space. Hence is on a line of with the points of ; and is on a 2-secant of with the points of . If is a point of , then as , they are adjacent in and so is a 2-secant of . Hence the points of lie in , and so .
As , we need equality in all three of these bounds, that is, , , and . Moreover,
| (3) |
To show that is a -clique of Class B, we need to show that and . Suppose that , so has dimension at most , that is . As contains , and , there exists a point with . By Result 2.3, there exists a unique generator of which contains and meets in a -space. Further, for each point , is a 2-secant of . Thus . By (3), , moreover we have . Hence , and so is a -space in . Recall that , and by assumption , so . Thus is a -space, and so by Result 2.2, meets in exactly the two generators . Now , so is an edge of , and so is a line of . As , and is a line of in , we have . So , contradicting the choice of . Hence . Thus meets in a -space, so by the construction of , we have . Substituting into (3), we see that is a -clique of Class B.
Lemma 5.5
The maximum size of a clique in is .
Proof Suppose , , contains a clique of size . Let be a vertex in , then is a -clique, and so by Theorem 5.4, has Class A or B. Table 2 gives the number of vertices of each type in the two different -cliques.
| -clique A | -clique B | |
|---|---|---|
| vertex type (i) | ||
| vertex type (ii) | ||
| vertex type (iii) |
As and has Class A or B, contains vertices of both type (i) and (ii). Let be a vertex of type (i) in and a vertex of type (ii) in . If has Class A, then using Table 2, we see that satisfies neither column, and so is not a -clique of , a contradiction. Similarly, if has Class B, then satisfies neither column, and so is not a -clique of . So there are no cliques of size , hence the -cliques are the maximal cliques of . A similar argument proves the result when .
In summary, we have classified the maximal cliques of as follows.
Theorem 5.6
Let be a non-singular quadric of of projective index , and let , , be the graph constructed in Theorem 3.3. If is a maximal clique of , then is a -clique of Class A or B.
5.2 Counting maximal cliques
In the previous section, we classified the maximal cliques in the graph , we count them here.
Theorem 5.7
Let be a non-singular quadric in of projective index . Let be the point-graph of and let , , be the graph constructed in Theorem 3.3.
-
1.
Let , then
-
(a)
has maximal cliques.
-
(b)
has maximal cliques.
-
(a)
-
2.
If , then
-
(a)
has maximal cliques.
-
(b)
has maximal cliques.
-
(a)
-
3.
If , then
-
(a)
has maximal cliques.
-
(b)
has maximal cliques.
-
(a)
Proof For part 1, we work in and let have point-graph . The maximal cliques of correspond exactly to the generators of . By [7, Theorem 22.5.1], the number of generators of is
proving 1(a). For part 1(b), let be a subspace of , , and let be the graph constructed from as in Theorem 3.3. Let , be the number of maximal cliques of of Class A and B respectively. By Lemma 5.1, is equal to the number of generators of that contain , and so by [7, Theorem 22.4.7],
| (4) |
To count the maximal cliques of Class B, by Lemma 5.1 we need to count the number of pairs of generators of such that contains , and meets in a -space not containing . The number of choices for is the number of generators of that contain , which is given in (4), and is . Once is chosen, we count the number of choices for . The number of -spaces contained in but not containing equals the number of -spaces contained in minus the number of -spaces contained in which contain . This is . By [7, Lemma 22.4.8], the number of generators of that meet in a fixed -space is four. Hence the number of choices for is . As the projective index of is , we have . Hence the total number of maximal cliques of is as required. This completes the proof of part 1. The proofs of parts 2 and 3 are similar.
Theorem 5.8
Let be a non-singular quadric in of projective index . Let , , be the graph constructed in Theorem 3.3. Let be a fixed vertex of , then the number of maximal cliques of containing according to the type of is given in the next table.
| number of maximal cliques of containing | |||
| type of | |||
| (i) | |||
| (ii) | |||
| (iii) | 5 | ||
| (i) | |||
| (ii) | |||
| (iii) | |||
| (i) | |||
| (ii) | |||
| (iii) | 3 |
Proof First consider the case where in . Let be a subspace of , , and let be the graph constructed from the point-graph of , as in Theorem 3.3. Let be a vertex of of type (i), so in , . All the maximal cliques of of Class A contain . So by (4), lies in maximal cliques of Class A. To form a maximal clique of of Class B that contains , we need two generators of such that contains , meets in a -space not containing , and . We count the number of pairs , satisfying this. First, the number of choices for equals the number of generators of containing which is . The number of -spaces of that contain is , and the number of -spaces of that contain and is . Hence the number of -spaces of that contain , but do not contain is . By [7, Lemma 22.4.8], the number of generators of that meet in a fixed -space is four. In total, the number of maximal cliques of Class B containing is as has projective index . Hence the total number of maximal cliques of containing is as required.
Now let be a vertex of of type (ii). The number of maximal cliques of Class A containing equals the number of generators of containing and which by [7, Theorem 22.4.7] is . To count the maximal cliques of that contain , we need to count pairs of generators of such that contains and , and meets in a -space not containing or . The number of choices for is calculated above to be . Further, the number of -spaces in is ; the number of -spaces of containing is ; the number of -spaces of containing and is ; and the number of -spaces of containing is . Hence the number of -spaces of that do not contain and do not contain is . As before, each of these -spaces lies in four suitable choices for the generator of . Hence the number of maximal cliques of Class B containing is as has projective index . Hence the total number of maximal cliques containing is as required.
Let be a vertex of of type (iii), so is not contained in , hence is in zero maximal cliques of Class A. To count the maximal cliques of of Class B containing , we need to count pairs of generators of such that contains , meets in a -space not containing , and contains . The number of choices for equals the number of generators of containing which is by (4). As contains , it contains no points of type (iii), so . So by Result 2.3, there is a unique generator of that contains and meets in a -space denoted . Further, if contained , then would be contained in , and so would be type (ii), a contradiction, so does not contain . So for each , there is a unique choice for that can be used to form a Class B maximal clique containing . Hence the number of maximal cliques of containing is as required. This completes the proof for the case . The cases when is and are similar.
6 The graphs are all non-isomorphic
Theorem 6.1
Let be a non-singular quadric in of projective index . Let be the point-graph of and let , , be the graph constructed in Theorem 3.3. Then is isomorphic to if and only if .
Proof We first show that . To construct from , we let be a subspace of of dimension , so is a point which we denote . We classify the points of , and so the vertices of , into type (i), (ii), (iii) with respect to . The point is the only point of of type (i). Note that lines in contain exactly three points. Consider the involution acting on the vertices of where: fixes vertices of type (i) and (iii); and maps a vertex of type (ii) to the vertex of type (ii) that corresponds to the third point of on the line . The involution maps to a graph . Incidence in is inherited from , that is, points and are adjacent in (so is a line of ) if and only if vertices and are adjacent in . The map is an isomorphism, so . We now show that .
By Corollary 4.5, we need to show that the edges of satisfy Table 1. First note that as there is only one point of type (i) in , the first row of Table 1 is not relevant. Let be points of of type (ii), and let be points of of type (iii). The incidences in rows 4 and 5 of Table 1 hold in , so as fixes points of type (i) and (iii), they also hold in .
To simplify notation, let and . Consider row 2 of Table 1: is an edge of if and only if is an edge of if and only if is a line of . Hence it follows from the definition of that is always an edge of as required.
Consider row 6 of Table 1: is an edge of if is an edge of , that is, if is a line of . As is type (iii), the plane is not contained in , and so by Result 2.2 meets in exactly the lines , . As is the third point on the line , the line is a 2-secant of as required.
Consider row 3 of Table 1. Suppose is an edge of , so is an edge of . If the line contains , then and , so is an edge of and so is a line of as required. Now suppose does not contain . Then an edge of implies is a line of . Hence the plane contains at least three lines, namely , and , and so by Result 2.2, is contained in . Further, it contains and , so is a line of as required. Hence the edges of satisfy Table 1. So by Corollary 4.5, .
We now show that with is not isomorphic to the graph by considering the maximal cliques. We prove the case when , the cases where is or are similar. The number of maximal cliques in and are given in (1a) and (1b) of Theorem 5.7. These numbers are equal if and only if . If , then the right hand side is , which is larger than the left hand side. So we have equality if and only if . Hence with is not isomorphic to .
Theorem 6.2
Let be a non-singular quadric in of projective index . Let be the point-graph of and let , , be the graph constructed in Theorem 3.3. Then the graphs are distinct up to isomorphism.
Proof We prove the case when , the cases where is or are similar. Let be two integers with . The number of maximal cliques in and are given in Theorem 5.7(1b). These two numbers are equal if and only if
| (5) |
As , the right hand side is greater than , which is greater than as . Hence the right hand side is greater than the left, so they cannot be equal. Thus and are not isomorphic if and are distinct.
6.1 Kantor’s graphs
In [8], Kantor constructs a strongly regular graph from a non-singular quadric in with the same parameters as the point-graph of . Kantor conjects that the graph is not the same as except in the case when . It is not known in general whether is isomorphic to . We show that is not isomorphic to the graphs when . Kantor’s construction works when the quadric contains a spread, however, we do not need to describe the details of Kantor’s graphs to prove non-isomorphism.
Theorem 6.3
Proof We use [8, Lemma 3.3] which shows that the vertices of can be partitioned into maximal cliques. We show that the vertices of , , cannot be partitioned into maximal cliques. Let be two maximal cliques of . We consider three cases. If are both of Class A, then they both contain , and so are not disjoint. If is Class A and is Class B, then contains , and meets in a -space. Hence as , contains at least one point of , so are not disjoint in this case.
Now consider the case where are maximal cliques of of Class B. Both meet in a subspace of dimension . If , then two subspaces of dimension contained in an -space meet in at least a point, and so share at least a point. Thus if , any two maximal cliques of share at least one vertex, and so the vertices of cannot be partition into maximal cliques, and hence , is not isomorphic to .
Now suppose , so is a line. A partition of the vertices of into maximal cliques partitions the points of . As every maximal clique of contains a point of , we are looking for a partition of into three maximal cliques of Class B, one through each point of . We show there is no such partition. First, a maximal clique has points, so three pairwise disjoint maximal cliques contain points, with either or . As , it follows that . Thus for the elliptic and parabolic case we have and for the hyperbolic case we have . However, as , contains points, contains points and contains points. None of these numbers is equal to when . Hence we cannot partition the vertices of , into maximal cliques. Thus by [8, Lemma 3.3], is not isomorphic to .
7 The automorphism group of
Let be a non-singular quadric in of projective index . Let be the point-graph of . Let be an -space contained in , , construct the partition of the points of given in Definition 3.2, and let be the graph constructed in Theorem 3.3. If , then by Theorem 6.1, so . In this section we determine the automorphism group of the graph , .
First note that the group of collineations of fixing is , see [7]. Moreover, if , then the group of automorphisms of is , see [10, Chapter 8].
The partition of the points of given in Definition 3.2 also partitions the vertices of and , . Vertices of type (i) in correspond in to the points of . Let denote the subgroup of automorphisms of that fix the set of vertices of type (i). As the graphs have the same set of vertices, if is a map acting on the vertices of , then is also a map acting on the vertices of . We will prove the following relationship between their automorphism groups.
Theorem 7.1
Let be a non-singular quadric in of projective index with point-graph . Let be an -space of , , and let be the graph constructed in Theorem 3.3. Then .
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 , see [9, Chapter 7] for more details. Let be a vector space of dimension over , and let be a quadratic form on with associated bilinear form . The radical of in is the subspace . Let be a subspace of and suppose there exists a linear isometry with respect to (that is, is an invertible linear map and for all . Then Witt’s theorem says that there exists a linear isometry such that for all if and only if . We interpret this in the projective space associated with . Let be a non-singular quadric in with homogeneous equation . If is odd, then . If is even, then and is the nucleus point of . As an example, let be subspaces of of the same dimension. If has a nucleus , then , so neither nor contain . As there exists a collineation of that maps to , it follows from Witt’s theorem that there exists a collineation of that fixes and maps to . We use Witt’s Theorem to prove the following lemma.
Lemma 7.2
Let be a non-singular quadric in of projective index . Let be an integer, , let be an -space of , and partition the points of into types (i), (ii), (iii) as in Definition 3.2. Then the subgroup of fixing is transitive on the points of each type.
Proof Let be two points of of type (i), so . There is a collineation of that fixes , and maps to . Hence by Witt’s theorem, there is a collineation of fixing and , and mapping to . Hence is transitive on the points of of type (i).
Let be points of of type (ii), so and are -spaces contained in . There is a collineation of that maps to , fixes , and maps to . Hence by Witt’s Theorem, there is a collineation of that fixes and , and maps to . Hence is transitive on the points of of type (ii).
Let be points of of type (iii), so and are -spaces which are not contained in . Now is an -space, and contains and the point , hence by Result 2.2, is exactly two -spaces. Similarly, is two -spaces, one being . So there is an automorphism of that maps to , fixes , and maps to . As are not contained in , in order to apply Witt’s Theorem, we need to consider the nucleus of when is even. Suppose is even, so , and has nucleus a point . We show that neither nor contain . Let and let be the tangent hyperplane to at . So contains and all the lines of through . Let , then contains and points of type (i) and (ii), but no points of type (iii). As is an -space contained in , it contains no points of type (iii). As the -space contains points of type (iii), meets in exactly the -space . Thus , and similarly . Hence by Witt’s Theorem there is a collineation of that fixes and , and maps to . Thus is transitive on the points of of type (iii).
We now show that if , then has at least three orbits on the vertices of , namely the vertices of each type.
Lemma 7.3
For , the vertices of of different types lie in a different number of maximal cliques.
Proof We prove the result for the case , the cases when is and are similar. Comparing the number of cliques through vertices of type (i), (ii) and (iii) in from Theorem 5.8, it is sufficient to show that are distinct where
If , then and . Hence , that is vertices of different types lie in a different number of maximal cliques. If , then and so are distinct.
Lemma 7.4
If , then . Further, has exactly three orbits on the vertices of , namely the vertices of each type.
Proof Recall that is the point-graph of a non-singular quadric in with projective index ; is an -space contained in ; and the vertices of are partitioned into types (i), (ii) and (iii) as given in Definition 3.2. Note that as , we need , and so .
Let , so is an automorphism of that fixes the set of vertices of of type (i). As have the same set of vertices, acts on the vertices of , and fixes the set of vertices of of type (i). Further, induces a bijection denoted acting on the points of and fixing . As , we have (see [10, Chapter 8]) so . By Lemma 7.2, preserves the type of a point in , hence preserves the type of a vertex in . By Corollary 4.5, the edges of are described in Table 1. As the collineation maps lines (respectively 2-secants) of to lines (2-secants) of , the map preserves adjacencies and non-adjacencies of vertex pairs of . That is , and so .
Further, by Lemma 7.2, is transitive on the points of of each type, so is transitive on the vertices of of each type. Hence has at most three orbits on the vertices of . By Lemma 7.3, has at least three orbits on the vertices of . Hence has exactly three orbits on the vertices of , namely the vertices of each type.
Lemma 7.5
For , .
Proof First note that if , then by Theorem 6.1, so . Suppose , and let . As and have the same set of vertices, is a bijection acting on the vertices of . We show that preserves adjacencies and non-adjacencies of vertices in .
By Corollary 4.5 and Table 1, the only difference in adjacencies between vertices in and are between a vertex of type (ii) and a vertex of type (iii). Let be two vertices of , there are two cases to consider. Firstly, if the pair consists of one vertex of type (ii) and one vertex of type (iii), then are adjacent in if and only if are non-adjacent in . Secondly, if the pair does not consist of one vertex of type (ii) and one vertex of type (iii), then are adjacent in if and only if are adjacent in . In either case, as preserves adjacency and non-adjacency in , preserves the adjacency or non-adjacency of the vertex pair in . Hence as required.
Proof of Theorem 7.1 By Lemma 7.5, , and so . As , by Lemma 7.4, fixes the set of vertices of type (i), that is , hence . By Lemma 7.4, , hence as required.
Finally we show that given a graph , we can reconstruct the graph and the quadric . If then by Theorem 6.1. So suppose , and define a graph whose vertices are the vertices of . The proof of Lemma 7.3 shows that the number of maximal cliques through a vertex of 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 into their types by using the number of maximal cliques through them. Define the edges of to be the same as the edges of , except swapping the adjacencies between vertices of type (ii) and (iii). Then by Corollary 4.5, is the point-graph of the quadric used to construct . We can now reconstruct the quadric from as follows. The maximal cliques of are exactly the generators of in . By intersecting the generators of , we can recover firstly the -spaces of , and so on, constructing the lattice of subspaces of the generators. Hence we can construct the points of , all the lines contained in , the planes contained in , …, the -spaces contained in .
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 ).
| quadric | , | , | , |
|---|---|---|---|
| number of new non-isomorphic graphs |
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.