An infinite family of semisymmetric graphs constructed from affine geometries
From MaRDI portal
Publication:1413236
DOI10.1016/S0195-6698(03)00079-9zbMath1026.05056MaRDI QIDQ1413236
Lin Zhang, FuRong Wang, Shao-Fei Du
Publication date: 16 November 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Related Items
Some semisymmetric graphs arising from finite vector spaces, Semisymmetric cubic graphs of twice odd order, Edge-transitive regular \(Z_n\)-covers of the Heawood graph, A construction for infinite families of semisymmetric graphs revealing their full automorphism group, A classification of semisymmetric graphs of order \(2p^3\): unfaithful case, Semisymmetric graphs of order \(2p^3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Biprimitive graphs of smallest order
- On edge but not vertex transitive regular graphs
- A classification of semisymmetric graphs of order 2pq
- The Gray graph revisited
- Constructing cubic edge- but not vertex-transitive graphs
- An infinite family of biprimitive semisymmetric graphs
- Regular line-symmetric graphs
- An Edge but not Vertex Transitive Cubic Graph*