On automorphisms of strongly regular locally cyclic graphs (Q416856)

From MaRDI portal





scientific article
Language Label Description Also known as
English
On automorphisms of strongly regular locally cyclic graphs
scientific article

    Statements

    On automorphisms of strongly regular locally cyclic graphs (English)
    0 references
    10 May 2012
    0 references
    A graph \(G\) is called edge-regular with parameters \((v,k,\lambda)\) if \(G\) is a regular graph of degree \(k\) and order \(v\) and each edge in \(G\) lies in \(\lambda\) triangles and \(G\) is called amply regular with parameters \((v,k,\lambda ,\mu )\) if \(G\) is edge-regular with parameters \((v,k,\lambda )\) and the subgraph induced by \(N(a)\cap N(b)\) contains \(\mu \) vertices if \(d(a,b)=2\). An amply regular graph of diameter 2 is called strongly regular. Also \(G\) is called edge-symmetric if its automorphism group acts transitively on the set of its ordered edges. \(G\) is said to be locally \(C_{k}\)-graph if the subgraph induced by \(N(a)\) is isomorphic to \(C_{k}\) for every vertex \(a\in V(G)\). In this paper the automorphisms of locally \(C_{k}\)-graphs are studied. The main result is the following theorem: Let \(G\) be a connected edge-symmetric strongly regular locally \(C_{k}\)-graph. If \(v\leq 1000\), then \(G\) has the parameters \((6,4,2,4),(13,6,2,3)\), or \((16,6,2,2)\).
    0 references
    0 references
    automorphism
    0 references
    strongly regular locally cyclic graph
    0 references
    edge-symmetric graph
    0 references
    Paley graph
    0 references
    solvable group
    0 references

    Identifiers