297 research outputs found
New Strongly Regular Graphs from Finite Geometries via Switching
We show that the strongly regular graph on non-isotropic points of one type
of the polar spaces of type , , , , and
are not determined by its parameters for . We prove this
by using a variation of Godsil-McKay switching recently described by Wang, Qiu,
and Hu. This also results in a new, shorter proof of a previous result of the
first author which showed that the collinearity graph of a polar space is not
determined by its spectrum. The same switching gives a linear algebra
explanation for the construction of a large number of non-isomorphic designs.Comment: 13 pages, accepted in Linear Algebra and Its Application
New strongly regular graphs from finite geometries via switching
We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type U(n, 2), O(n, 3), O(n, 5), O+ (n, 3), and O- (n, 3) are not determined by its parameters for n >= 6. We prove this by using a variation of Godsil-McKay switching recently described by Wang, Qiu, and Hu. This also results in a new, shorter proof of a previous result of the first author which showed that the collinearity graph of a polar space is not determined by its spectrum. The same switching gives a linear algebra explanation for the construction of a large number of non-isomorphic designs. (C) 2019 Elsevier Inc. All rights reserved
Graphs with many valencies and few eigenvalues
Dom de Caen posed the question whether connected graphs with three distinct
eigenvalues have at most three distinct valencies. We do not answer this
question, but instead construct connected graphs with four and five distinct
eigenvalues and arbitrarily many distinct valencies. The graphs with four
distinct eigenvalues come from regular two-graphs. As a side result, we
characterize the disconnected graphs and the graphs with three distinct
eigenvalues in the switching class of a regular two-graph
Strongly regular graphs satisfying the 4-vertex condition
We survey the area of strongly regular graphs satisfying the 4-vertex
condition and find several new families. We describe a switching operation on
collinearity graphs of polar spaces that produces cospectral graphs. The
obtained graphs satisfy the 4-vertex condition if the original graph belongs to
a symplectic polar space.Comment: 19 page
- …