Lifting constructions of strongly regular Cayley graphs

We give two “lifting” constructions of strongly regular Cayley graphs. In the first construction we “lift” a cyclotomic strongly regular graph by using a subdifference set of the Singer difference sets. The second construction uses quadratic forms over finite fields and it is a common generalization of the construction of the affine polar graphs [7] and a construction of strongly regular Cayley graphs given in [15]. The two constructions are related in the following way: the second construction can be viewed as a recursive construction, and the strongly regular Cayley graphs obtained from the first construction can serve as starters for the second construction. We also obtain association schemes from the second construction.     

5-chromatic strongly regular graphs

In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5. Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph. For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic. In this way, we deal completely with 34 of these parameter sets using eigenvalue techniques and computer enumerations.     

A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs

In this paper the Wallis-Fon-Der-Flaass construction of strongly regular graphs is generalized. As a result new prolific series of strongly regular graphs are obtained. Some of them have new parameters. The author was partially supported by the Israeli Ministry of Absorption.     

On a conjecture of Brouwer involving the connectivity of strongly regular graphs

In this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum number of vertices of a strongly regular graph whose removal disconnects the graph into non-singleton components.We show that strongly regular graphs constructed from copolar spaces and from the more general spaces called Δ-spaces are counterexamples to Brouwer?s Conjecture. Using J.I. Hall?s characterization of finite reduced copolar spaces, we find that the triangular graphs T(m), the symplectic graphs Sp(2r,q) over the field Fq (for any q prime power), and the strongly regular graphs constructed from the hyperbolic quadrics O⁺(2r,2) and from the elliptic quadrics O⁻(2r,2) over the field F₂, respectively, are counterexamples to Brouwer?s Conjecture. For each of these graphs, we determine precisely the minimum number of vertices whose removal disconnects the graph into non-singleton components. While we are not aware of an analogue of Hall?s characterization theorem for Δ-spaces, we show that complements of the point graphs of certain finite generalized quadrangles are point graphs of Δ-spaces and thus, yield other counterexamples to Brouwer?s Conjecture.We prove that Brouwer?s Conjecture is true for many families of strongly regular graphs including the conference graphs, the generalized quadrangles GQ(q,q) graphs, the lattice graphs, the Latin square graphs, the strongly regular graphs with smallest eigenvalue −2 (except the triangular graphs) and the primitive strongly regular graphs with at most 30 vertices except for few cases.We leave as an open problem determining the best general lower bound for the minimum size of a disconnecting set of vertices of a strongly regular graph, whose removal disconnects the graph into non-singleton components.     

Ring geometries,two-weight codes,and strongly regular graphs

It is known that a projective linear two-weight code C over a finite field corresponds both to a set of points in a projective space over that meets every hyperplane in either a or b points for some integers a < b, and to a strongly regular graph whose vertices may be identified with the codewords of C. Here we extend this classical result to the case of a ring-linear code with exactly two nonzero homogeneous weights and sets of points in an associated projective ring geometry. We will introduce regular projective two-weight codes over finite Frobenius rings, we will show that such a code gives rise to a strongly regular graph, and we will give some constructions of two-weight codes using ring geometries. All these examples yield infinite families of strongly regular graphs with non-trivial parameters.      

Strongly regular Cayley graphs from partitions of subdifference sets of the Singer difference sets

In this paper, we give a new lifting construction of “hyperbolic” type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of subdifference sets of the Singer difference sets. Our results unify some recent constructions of strongly regular Cayley graphs related to m-ovoids and i-tight sets in finite geometry. Furthermore, some of the strongly regular Cayley graphs obtained in this paper are new or nonisomorphic to known strongly regular graphs with the same parameters.     

There is no (95, 40, 12, 20) strongly regular graph

We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.     

Embeddings of Un(q2) and symmetric strongly regular graphs

In the geometric setting of the embedding of the unitary group U_n(q²) inside an orthogonal or a symplectic group over the subfield GF(q) of GF(q²), q odd, we show the existence of infinite families of transitive two‐character sets with respect to hyperplanes that in turn define new symmetric strongly regular graphs and two‐weight codes. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 248–253, 2010     

Regular graphs constructed from the classical generalized quadrangle Q(4, q)

Let c_k be the smallest number of vertices in a regular graph with valency k and girth 8. It is known that c_{k + 1}?2(1 + k + k² + k³) with equality if and only if there exists a finite generalized quadrangle of order k. No such quadrangle is known when k is not a prime power. In this case, small regular graphs of valency k + 1 and girth 8 can be constructed from known generalized quadrangles of order q>k by removing a part of its structure. We investigate the case when q = k + 1 is a prime power, and try to determine the smallest graph under consideration that can be constructed from a generalized quadrangle of order q. This problem appears to be much more difficult than expected. We have general bounds and improve these for the classical generalized quadrangle Q(4, q), q even. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:70‐83, 2010     

GQ(4, 2)-extensions, strongly regular case

A strongly regular locallyGQ(4, 2)-graph is a graph with parameters either (126, 45, 12, 8) or (190, 45, 12, 10). The existence and the uniqueness of the corresponding locallyGQ(4, 2)-graph in the first case are well known. We prove that theGQ(4, 2)-hyperoval on ten vertices either is the Petersen graph, or is the Möbius 5-prism, or consists of two (2, 3)-subgraphs connected by three edges. We obtain homogeneousGQ(4, 2)-solutions with a strongly regular point graph; in particular, this implies the negative answer to the question of F. Buekenhout concerning the existence of a locallyGQ(4, 2)-graph with the parameters (190, 45, 12, 10).     

Quasi-symmetric 2-(64,24,46) designs derived from AG(3,4)

This paper completes the enumeration of quasi-symmetric 2-$(64,24,46)$ designs supported by the dual code $C^{\perp }$ of the binary linear code $C$ spanned by the lines of $AG(3,4)$, initiated in Rodrigues and Tonchev (2015). It is shown that $C^{\perp }$ supports exactly 30,264 nonisomorphic quasi-symmetric 2-$(64,24,46)$ designs. The automorphism groups of the related strongly regular graphs are computed.     

一类(a+1,3)型的距离正则图

设Γ是直径为d且型为(α 1,3)的距离正则图,其中α≥2.用l(c,a,b)表示交叉阵列l(Γ)中列(c,a,b)~t的个数,记r=r(Γ)=l(c_1,a_1,b_1),s=s(Γ)=l(c_(r 1),a(r 1),b_(r 1)).那末,若c_(r 1)=3且a_(r 1)=3a,则d=r s 1,c_d=4且Γ为正则拟2d边形.     

Arc-transitive cubic Cayley graphs on PSL(2,p)

For a prime p at least 5,let T=PSL(2,p).This paper gives a classification of the connected arc-transitive cubic Cayley graphs on T and a determination of the gener- ated pairs ((?),(?)) of T such that o((?))=2 and o((?))=3.