A quartic symmetric graph is a regular graph that is both vertex-transitive and edge-transitive
and has vertex degree 4. The numbers of symmetric quartic graphs on , 2, ... are 0, 0, 0, 0, 1, 1, 0, 1, 1, ... (OEIS A087101).
Some quartic symmetric graphs are illustrated above and listed in the following table.
Among quartic symmetric graphs, the 54-node Bouwer graph constructed by Bouwer (1970)
is half-arc-transitive. The smaller
27-node Doyle graph was independently discovered by
Doyle (1976) and Holt (1981).
Among quartic symmetric graphs, Potočnik et al. (2013) enumerated the arc-transitive subclass through 640 vertices, comprising 4,820 connected
graphs.