A graph is called cubic (respectively tetravalent) if all of its vertices have valency 3 (respectively valency 4). It is called vertex-transitive (respectively arc-transitive) if its automorphism group acts transitively on its vertex-set (respectively arc-set). In this paper, we combine some new theoretical results with computer calculations to determine all cubic vertex-transitive graphs of order at most 1280. In the process, we also determine all tetravalent arc-transitive graphs of order at most 640. © 2012 Elsevier B.V.
Potočnik, P., Spiga, P., Verret, G. (2013). Cubic vertex-transitive graphs on up to 1280 vertices. JOURNAL OF SYMBOLIC COMPUTATION, 50, 465-477 [10.1016/j.jsc.2012.09.002].
Cubic vertex-transitive graphs on up to 1280 vertices
SPIGA, PABLOSecondo
;
2013
Abstract
A graph is called cubic (respectively tetravalent) if all of its vertices have valency 3 (respectively valency 4). It is called vertex-transitive (respectively arc-transitive) if its automorphism group acts transitively on its vertex-set (respectively arc-set). In this paper, we combine some new theoretical results with computer calculations to determine all cubic vertex-transitive graphs of order at most 1280. In the process, we also determine all tetravalent arc-transitive graphs of order at most 640. © 2012 Elsevier B.V.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
