Strongly regular graphs from classical generalized quadrangles (Q1675283)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Strongly regular graphs from classical generalized quadrangles
scientific article

    Statements

    Strongly regular graphs from classical generalized quadrangles (English)
    0 references
    0 references
    0 references
    27 October 2017
    0 references
    A strongly regular graph is a graph with \(v\) vertices such that every vertex lies on \(k\) edges, any two adjacent vertices have \(\lambda\) common neighbors and any two non-adjacent vertices have \(\mu\) common neighbors. A generalized quadrangle of order \((s,t)\) is an incidence structure of points and lines such that any two points are incident with at most one line, every point is incident with \(t+1\) lines, every line is incident with \(s+1\) points, and for any point \(P\) and line \(\ell\) which are not incident there is a unique point on \(\ell\) that is collinear with \(P\). The authors prove the existence of pseudo-geometric strongly regular graphs with the same parameters of the point-graph of a generalized quadrangle \(\mathrm{GQ}(s,t)\) that are not geometric, when \(s\) is an even power of a prime and \(t\) is either \(s\) or \(s\sqrt{s}\).
    0 references
    strongly regular graphs
    0 references
    generalized quadrangles
    0 references
    projective geometry
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references