Constructing cubic edge- but not vertex-transitive graphs

DOI10.1002/1097-0118(200010)35:2%3C152::AID-JGT7%3E3.0.CO;2-IMaRDI QIDQ4518338zbMATH OpenOpenAlexFDO

Authors Dragan Marušič

Publication date 16 October 2003

Full work available at URL https://doi.org/10.1002/1097-0118(200010)35:2%3C152::aid-jgt7%3E3.0.co;2-i

zbMATH Keywords

alternating groupautomorphism groupsCayley graphsedge stabilizers

Mathematics Subject Classification ID

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

Recommendations

• An infinite family of cubic edge- but not vertex-transitive graphs
• Cubic edge-transitive graphs of order 22p^n.
• On the cubic edge-transitive graphs of order 58p^2
• Constructing \(\frac{1}{2}\)-arc-transitive graphs of valency 4 and vertex stabilizer \(Z_2\times Z_2\)
• A classification of cubic edge-transitive graphs of order 4p^3

Cites work

• An Edge but not Vertex Transitive Cubic Graph^*
• Finite Permutation Groups and Finite Simple Groups
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• On edge but not vertex transitive regular graphs
• Regular line-symmetric graphs

Cited in

(22)

• 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}\)
• An infinite family of cubic edge- but not vertex-transitive graphs
• Note on infinite families of trivalent semisymmetric graphs
• Cubic semisymmetric graphs of order 2qp^2
• A census of semisymmetric cubic graphs on up to 768 vertices
• Distance-balanced graphs: symmetry conditions
• Some Topics in Graph Theory
• Semisymmetric \(Z_p\)-covers of the \(C20\) graph
• The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
• Semisymmetric elementary abelian covers of the Heawood graph
• Cubic factor-invariant graphs of cycle quotient type -- the alternating case
• Edge-transitive cyclic regular covers of the Möbius-Kantor graph
• Cubic semisymmetric graphs of order \(6p^{3}\)
• Classifying cubic semisymmetric graphs of order \(18p^n\)
• Cubic semisymmetric graphs of order \(8p ^{3}\)
• Semisymmetric cubic graphs of twice odd order
• Semisymmetric graphs
• Semisymmetric cubic graphs as regular covers of \(K_{3,3}\)
• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• Edge-transitive regular \(Z_n\)-covers of the Heawood graph

This page was built for publication: Constructing cubic edge- but not vertex-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518338)