Affine flag graphs and classification of a family of symmetric graphs with complete quotients

From MaRDI portal
Publication:1999745



Abstract: A graph Gamma is G-symmetric if G is a group of automorphisms of Gamma which is transitive on the set of ordered pairs of adjacent vertices of Gamma. If V(Gamma) admits a nontrivial G-invariant partition calB such that for blocks B,CincalB adjacent in the quotient graph GammacalB of Gamma relative to calB, exactly one vertex of B has no neighbour in C, then Gamma is called an almost multicover of GammacalB. In this case an incidence structure with point set calB arises naturally, and it is a (G,2)-point-transitive and G-block-transitive 2-design if in addition GammacalB is a complete graph. In this paper we classify all G-symmetric graphs Gamma such that (i) calB has block size |B|ge3; (ii) GammacalB is complete and almost multi-covered by Gamma; (iii) the incidence structure involved is a linear space; and (iv) G contains a regular normal subgroup which is elementary abelian. This classification together with earlier results in [A. Gardiner and C. E. Praeger, Australas. J. Combin. 71 (2018) 403--426], [M.~Giulietti et al., J. Algebraic Combin. 38 (2013) 745--765] and [T. Fang et al., Electronic J. Combin. 23 (2) (2016) P2.27] completes the classification of symmetric graphs satisfying (i) and (ii).




Cites work









This page was built for publication: Affine flag graphs and classification of a family of symmetric graphs with complete quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999745)