Note on infinite families of trivalent semisymmetric graphs

DOI10.1006/eujc.2002.0594zbMath1014.05032OpenAlexW2041398314MaRDI QIDQ1864584

Seymour Lipschutz, Ming-Yao 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)

Related Items (8)

Semisymmetric cubic graphs of twice odd order ⋮ Pentavalent semisymmetric graphs of square‐free order ⋮ On edge-transitive cubic graphs of square-free order ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ Edge-transitive regular \(Z_n\)-covers of the Heawood graph ⋮ A census of semisymmetric cubic graphs on up to 768 vertices ⋮ Distance-balanced graphs: symmetry conditions ⋮ Characterising vertex-star transitive and edge-star transitive graphs

Cites Work

• Biprimitive graphs of smallest order
• Vertex-transitive graphs
• On edge but not vertex transitive regular graphs
• On the Symmetry of Cubic Graphs
• A classification of semisymmetric graphs of order 2pq
• Constructing cubic edge- but not vertex-transitive graphs
• An infinite family of biprimitive semisymmetric graphs
• Regular line-symmetric graphs
• An Edge but not Vertex Transitive Cubic Graph^*
• Semisymmetry of generalized Folkman graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on infinite families of trivalent semisymmetric graphs