Trivalent symmetric graphs of order at most 120

DOI10.1016/S0195-6698(84)80030-XzbMath0537.05026OpenAlexW2039812826MaRDI QIDQ792332

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

zbMATH Keywords

automorphism grouptrivalent graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (3)

Trivalent Non-symmetric Vertex-Transitive Graphs of Order at Most 150 ⋮ Cubic semisymmetric graphs of order \(8p ^{3}\) ⋮ Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\)

Cites Work

• Vertex-transitive graphs of valency 3
• On the Symmetry of Cubic Graphs
• On Trivalent Graphs
• Endliche Gruppen I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trivalent symmetric graphs of order at most 120