Note on infinite families of trivalent semisymmetric graphs
From MaRDI portal
Publication:1864584
DOI10.1006/EUJC.2002.0594zbMATH Open1014.05032OpenAlexW2041398314MaRDI QIDQ1864584FDOQ1864584
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the Symmetry of Cubic Graphs
- Title not available (Why is that?)
- Biprimitive graphs of smallest order
- Vertex-transitive graphs
- A classification of semisymmetric graphs of order 2pq
- Title not available (Why is that?)
- On edge but not vertex transitive regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular line-symmetric graphs
- An Edge but not Vertex Transitive Cubic Graph*
- Semisymmetry of generalized Folkman graphs
- Constructing cubic edge- but not vertex-transitive graphs
- An infinite family of biprimitive semisymmetric graphs
Cited In (11)
- 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
- Title not available (Why is that?)
- Edge-transitive cubic graphs of twice square-free order
- Semisymmetric cubic graphs of twice odd order
- A worthy family of semisymmetric graphs
- 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)
