|
Search: id:A059687
|
|
|
| A059687 |
|
Number of basic circuits of nullity n. |
|
+0
1
|
| |
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Appears to be the same as number of 3-connected cubic graphs on 2, 4, 6, 8, 10, 12 and 14 vertices. - Gordon Royle, Jun 02, 2003
|
|
REFERENCES
|
R. M. Foster, Geometrical circuits of electrical networks, Transactions of the American Institute of Electrical Engineers, 51 (1932), 309-317.
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.
|
|
EXAMPLE
|
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.
|
|
CROSSREFS
|
Cf. A002631.
Sequence in context: A030853 A030962 A030830 this_sequence A030909 A030809 A030958
Adjacent sequences: A059684 A059685 A059686 this_sequence A059688 A059689 A059690
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 06 2001
|
|
|
Search completed in 0.002 seconds
|
