Constructing cubic edge- but not vertex-transitive graphs
From MaRDI portal
Publication:4518338
DOI<152::AID-JGT7>3.0.CO;2-I 10.1002/1097-0118(200010)35:2<152::AID-JGT7>3.0.CO;2-IzbMath1021.05050OpenAlexW4251390195MaRDI QIDQ4518338
Publication date: 16 October 2003
Full work available at URL: https://doi.org/10.1002/1097-0118(200010)35:2<152::aid-jgt7>3.0.co;2-i
Related Items
Semisymmetric cubic graphs of twice odd order ⋮ Semisymmetric elementary abelian covers of the Heawood graph ⋮ A worthy family of semisymmetric graphs ⋮ An infinite family of semisymmetric graphs constructed from affine geometries ⋮ Cubic edge-transitive graphs of order 2\(p^{3}\) ⋮ Edge-transitive cyclic regular covers of the Möbius-Kantor graph ⋮ Semisymmetric graphs ⋮ Semisymmetric cubic graphs as regular covers of \(K_{3,3}\) ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ Semisymmetric Zp-covers of the C20 graph ⋮ Edge-transitive regular \(Z_n\)-covers of the Heawood graph ⋮ Cubic semisymmetric graphs of order \(6p^{3}\) ⋮ A census of semisymmetric cubic graphs on up to 768 vertices ⋮ Cubic semisymmetric graphs of order \(2qp^2\) ⋮ Distance-balanced graphs: symmetry conditions ⋮ Some Topics in Graph Theory ⋮ Classifying cubic semisymmetric graphs of order \(18p^n\) ⋮ Cubic semisymmetric graphs of order \(8p ^{3}\) ⋮ Note on infinite families of trivalent semisymmetric graphs
Cites Work
