Note on infinite families of trivalent semisymmetric graphs
From MaRDI portal
(Redirected from Publication:1864584)
Recommendations
Cites work
- 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?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- 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
- On edge but not vertex transitive regular graphs
- On the Symmetry of Cubic Graphs
- Regular line-symmetric graphs
- Semisymmetry of generalized Folkman graphs
- Vertex-transitive graphs
Cited in
(11)- Distance-balanced graphs: symmetry conditions
- Pentavalent semisymmetric graphs of square‐free order
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
- A census of semisymmetric cubic graphs on up to 768 vertices
- On edge-transitive cubic graphs of square-free order
- Characterising vertex-star transitive and edge-star transitive graphs
- Edge-transitive regular \(Z_n\)-covers of the Heawood graph
- scientific article; zbMATH DE number 2214062 (Why is no real title available?)
- Edge-transitive cubic graphs of twice square-free order
- Semisymmetric cubic graphs of twice odd order
- A worthy family of semisymmetric graphs
This page was built for publication: Note on infinite families of trivalent semisymmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864584)
