Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\) (Q403921)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\)
scientific article

    Statements

    Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\) (English)
    0 references
    29 August 2014
    0 references
    A graph \(\Gamma\) is said to be edge-regular with parameters \((v,k,\lambda)\) if it is a regular graph of degree \(k\) on \(v\) vertices and each of its edges lies in \(\lambda\) triangles. \(\Gamma\) is called an amply regular graph with parameters \((v, k, \lambda, \mu)\) if it is an edge-regular graph with the corresponding parameters and any two vertices \(a\) and \(b\) with distance \(d(a,b)=2\) have exactly \(\mu\) common neighbors. An amply regular graph of diameter 2 is said to be strongly regular. The point graph of an \(\alpha\)-partial geometry of order \((s,t)\), denoted by \(pG_{\alpha}(s,t)\), is defined on the set of points, and two points are adjacent if they lie on a line; it is strongly regular. Such a strongly regular graph for some positive integers \(\alpha\), \(s\), and \(t\) is called a pseudogeometric graph for \(pG_{\alpha}(s, t)\). The main result of this paper is the following: Let \(\Gamma\) be an amply regular graph whose subgraphs induced by the neighborhoods of all vertices are pseudogeometric graphs for \(pG_{s-3}(s, t)\). Then one of the following assertions holds: (1) \(\Gamma\) is a strongly regular graph, (2) the diameter of \(\Gamma\) is 3, (3) the diameter of \(\Gamma\) is greater than 3 and either \(s=4\) or \(s=5\) and \(t\leq 6\).
    0 references
    0 references
    0 references
    amply regular graph
    0 references
    edge-regular graph
    0 references
    strongly regular graph
    0 references
    pseudogeometric graph
    0 references
    distance-regular graph
    0 references
    Johnson graph
    0 references
    Taylor graph
    0 references
    intersection array
    0 references
    spectrum
    0 references
    Terwilliger's theorem
    0 references