|
%I #10 Oct 05 2019 19:20:51
%S 4,6,8,10,14,18,20,20,28,30,90,102
%N Orders of cubic (i.e., trivalent, 3-regular) distance-transitive connected graphs, from smallest to largest, with duplications when there exist multiple graphs with the same order.
%C "Order" is the number of vertices.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Symmetric_graph#Examples">Foster census of cubic symmetric graphs</a>
%Y Cf. A075124 (cubic symmetric graphs).
%K nonn,fini,full
%O 1,1
%A _Harry Richman_, Oct 04 2019
|
