Note on infinite families of trivalent semisymmetric graphs

DOI10.1006/EUJC.2002.0594MaRDI QIDQ1864584zbMATHOpenAlexFDO

Authors Seymour Lipschutz, Mingyao Xu

Publication date 18 March 2003

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.2002.0594

zbMATH Keywords

semisymmetric graphbicoset graph

Mathematics Subject Classification ID

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

Recommendations

• A family of semisymmetric graphs constructed from affine geometries
• An infinite family of biprimitive semisymmetric graphs
• A classification of semisymmetric graphs of order 2pq
• scientific article; zbMATH DE number 5008078
• An infinite family of semisymmetric graphs constructed from affine geometries

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)

• scientific article; zbMATH DE number 2214062 (Why is no real title available?)
• Pentavalent semisymmetric graphs of square‐free order
• A worthy family of semisymmetric graphs
• Characterising vertex-star transitive and edge-star transitive graphs
• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• On edge-transitive cubic graphs of square-free order
• Semisymmetric cubic graphs of twice odd order
• A census of semisymmetric cubic graphs on up to 768 vertices
• Edge-transitive cubic graphs of twice square-free order
• Edge-transitive regular \(Z_n\)-covers of the Heawood graph
• Distance-balanced graphs: symmetry conditions

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)