|
%I #13 Jun 12 2018 16:04:06
%S 1,1,1,2,4,14,57
%N Number of basic circuits of nullity n.
%C Appears to be the same as number of 3-connected cubic graphs on 2, 4, 6, 8, 10, 12 and 14 vertices. - _Gordon F. Royle_, Jun 02 2003
%D R. M. Foster, Geometrical circuits of electrical networks, Transactions of the American Institute of Electrical Engineers, 51 (1932), 309-317.
%D R. M. Foster, Topologic and algebraic considerations in network synthesis, pp. 8-18 in Proceedings of the Symposium on Modern Network Synthesis, New York, 1952, pp. 8-18. Polytechnic Institute of Brooklyn, New York, N. Y., 1952.
%D A. Krapez, S. K. Simic, D. V. Tosic, Parastrophically uncancellable quasigroup equations, Aequat. Math. 79 (3) (2010) 261-280 doi:10.1007/s00010-010-0016-3
%e n=2: 3 edges in parallel between 2 nodes; n=3: K_4; n=4: K_{3,3} and the trivalent graph with 6 nodes and 9 edges formed by the 1-skeleton of a triangular prism.
%Y Cf. A002631, A204198.
%K nonn,nice
%O 1,4
%A _N. J. A. Sloane_, Feb 06 2001
|
