Trivalent symmetric graphs of order at most 120
From MaRDI portal
Publication:792332
DOI10.1016/S0195-6698(84)80030-XzbMATH Open0537.05026OpenAlexW2039812826MaRDI QIDQ792332FDOQ792332
Authors: Peter Lorimer
Publication date: 1984
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(84)80030-x
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)
Cites Work
- Graph theory with applications
- Endliche Gruppen I
- Title not available (Why is that?)
- On the Symmetry of Cubic Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Trivalent Graphs
- Title not available (Why is that?)
- Vertex-transitive graphs of valency 3
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trivalent Non-symmetric Vertex-Transitive Graphs of Order at Most 150
- Cubic semisymmetric graphs of order \(8p ^{3}\)
- Kantentransitive Graphen und Gruppen vom Rang 2. (Edge transitive graphs and groups of rank 2)
- Characterizing symmetric diametrical graphs of order 12 and diameter 4
This page was built for publication: Trivalent symmetric graphs of order at most 120
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792332)