An infinite family of semisymmetric graphs constructed from affine geometries
From MaRDI portal
Recommendations
Cites work
- A classification of semisymmetric graphs of order 2pq
- An Edge but not Vertex Transitive Cubic Graph*
- An infinite family of biprimitive semisymmetric graphs
- Biprimitive graphs of smallest order
- Constructing cubic edge- but not vertex-transitive graphs
- scientific article; zbMATH DE number 4158649 (Why is no real title available?)
- scientific article; zbMATH DE number 4023321 (Why is no real title available?)
- scientific article; zbMATH DE number 3745208 (Why is no real title available?)
- On edge but not vertex transitive regular graphs
- Regular line-symmetric graphs
- The Gray graph revisited
Cited in
(12)- A worthy family of semisymmetric graphs
- Note on infinite families of trivalent semisymmetric graphs
- Affine primitive groups and semisymmetric graphs
- 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\)
- Semi-Affine Coxeter-Dynkin Graphs and G ⊆ SU2(C)
- Some semisymmetric graphs arising from finite vector spaces
- A family of semisymmetric graphs constructed from affine geometries
- Semisymmetric cubic graphs of twice odd order
- Semisymmetric graphs from polytopes
- Edge-transitive regular \(Z_n\)-covers of the Heawood graph
This page was built for publication: An infinite family of semisymmetric graphs constructed from affine geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413236)