An infinite family of semisymmetric graphs constructed from affine geometries

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)

zbMATH Keywords

affine geometryvertex transitive graphsemisymmetric graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (6)

Semisymmetric cubic graphs of twice odd order ⋮ Semisymmetric graphs of order \(2p^3\) ⋮ Some semisymmetric graphs arising from finite vector spaces ⋮ A construction for infinite families of semisymmetric graphs revealing their full automorphism group ⋮ Edge-transitive regular \(Z_n\)-covers of the Heawood graph ⋮ A classification of semisymmetric graphs of order \(2p^3\): unfaithful case

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^*

This page was built for publication: An infinite family of semisymmetric graphs constructed from affine geometries