DOI: 10.5281/zenodo.6576525
title: Cubic vertex-transitive graphs on up to 1280 vertices.

description: The <strong>Census of cubic vertex-transitive graphs</strong> contains the list of all cubic vertex-transitive graphs on at most 1280 vertices, together with a number of graph-theoretic properties (listed below). The list of graphs was originally compiled by Pablo Spiga, Gabriel Verret, and Primož Potočnik. The authors described the theoretical results and computations that were needed to compile the list in the paper Cubic vertex-transitive graphs on up to 1280 vertices. The original dataset files are available on Potočnik's website. The graph-theoretic properties were either computed or verified with the SageMath system, with a few exceptions. Some of the properties were not supported by SageMath at the time of computation, and were contributed: is_cayley, odd_girth, is_partial_cube (based on some previous code). The methods is_moebius_ladder, is_prism, and is_spx (together with SPX constructions) were computed in DiscreteZOO. A searchable version of this dataset is available on an instance of the MathDataHub platform hosted at mdh.graphsym.net/collection/CVT. You can download this collection either as an SQLite database or as CSV files. Contents: master_db_zenodo.sqlite3: the SQLite database, create_database.sql: the SQL script that creates empty database schema used in the SQLite database (not necessary for opening the database), main_Graph.txt: the main table containing graphs as a CSV file, main_Graph.sample.txt: a sample of the main table, main_CLTime.txt: the table containing canonical labelling computation times as a CSV file. main_CLTime.sample.txt: a sample of the canonical labeling table <strong>Structure and contents</strong> Each graph is given a census-specific identifier <em>CVT[n,i]</em> (the <em>i</em>-th graph of order <em>n</em> in the census). Some graphs have a list of more easily recognized names (such as the Petersen graph). The dataset contains graphs in two formats: the sparse6 format and a format readable by the computer algebra system Magma. For compatibility with SQLite, boolean values are represented with ones and zeroes (true and false, respectively). Data columns with types: canonical_label (string): the graph in sparse6 format, canonically labelled with nauty (call with no additional arguments), version: nauty-27r3, cvt_index (string): the census-specific identifier <em>CVT[n,i]</em> (the <em>i</em>-th graph of order <em>n</em> in the census), data (string): the graph in sparse6 format, raw_magma_code (string): the list of vertex neighbourhoods, readable by the computer algebra system Magma, name (string): a list of names of the graph, number_of_vertices (integer): number of vertices in the graph, clique_number (integer): the number of vertices in the largest clique subgraph, diameter (integer): the greatest distance between any pair of points, girth (integer): the length of the shortest cycle in the graph, is_arc_transitive (boolean): for every two ordered pairs of adjacent vertices, does there exist an automorphism, mapping one to the other, is_bipartite (boolean): can the vertices of the graph be partitioned into two sets, such that every edge connects a vertex in one set to a vertex in the other set, is_cayley (boolean): can the graph be constructed as a Cayley graph of some group for some generating set, is_distance_regular (boolean): for any two vertices <em>v</em> and <em>w</em>, does the number of vertices at distance <em>j</em> from <em>v</em> and at distance <em>k</em> from <em>w</em> depend only upon <em>j</em>, <em>k</em>, and <em>i = d(v, w)</em>, is_distance_transitive (boolean): for any two vertices <em>v</em> and <em>w</em> at any distance <em>i</em>, and any other two vertices <em>x</em> and <em>y</em> at the same distance, is there an automorphism of the graph that carries <em>v</em> to <em>x</em> and <em>w</em> to <em>y</em>, is_edge_transitive (boolean): for every two edges, does there exist an automorphism, mapping one to the other, is_hamiltonian (boolean): does the graph have a cycle that visits each vertex exactly once, is_partial_cube (boolean): is the graph isometric to a subgraph of a hypercube, is_split (boolean): can the vertices of the graph be partitioned into a clique and an independent set, is_strongly_regular (boolean): do there exists \(\lambda\) and \(\mu\) such that every two adjacent vertices have \(\lambda\) common neighbours and every two non-adjacent vertices have \(\mu\) common neighbours, odd_girth (integer): length of the shortest odd cycle, triangles_count (integer): the number of cycles of length <em>3</em> in the graph, is_moebius_ladder (boolean): is the graph a Möbius ladder, is_prism (boolean): is the graph a skeleton of a prism, is_spx (boolean): does the graph belong to the Split Praeger-Xu family of graphs, vertex_stabilizer (list of integer pairs): the order of the vertex stabilizer of the graph's automorphism group, given as a prime factorization; a list of pairs \((p_i, e_i)\) of primes and exponents such that \(\prod_i p_i^{e_i}\) is the order of the vertex stabilizer. This work was partially supported by ARRS research project no. J1-1691.
description: {"references": ["Poto\u010dnik, P., Spiga, P., Verret, G.: Cubic vertex-transitive graphs on up to 1280 vertices. J. Symbolic Comput. 50, 465\u2013477 (2013). https://doi.org/10.1016/j.jsc.2012.09.002"]}