|
%I #9 Jun 22 2017 10:24:35
%S 1,0,1,0,0,1,1,1,0,0,0,1,2,4,3,2,1,1,0,0,0,0,1,2,8,14,21,20,20,12,9,4,
%T 2,1,1,0,0,0,0,0,1,2,10,31,76,137,221,285,321,301,253,182,122,69,38,
%U 19,10,4,2,1,1,0,0,0,0,0,0,1,2,11,43,162,451,1121,2314,4255,6702
%N Triangle read by rows: T(n,k) = number of unlabeled bicolored graphs with no isolated nodes having 2n nodes and k edges, with n nodes of each color. Here n >= 0, 0 <= k <= n^2.
%C The colors may be interchanged.
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
%H R. W. Robinson, <a href="/A123547/b123547.txt">Rows 0 through 7, flattened</a>
%H F. Harary, L. March and R. W. Robinson, <a href="https://doi.org/10.1068/b050031">On enumerating certain design problems in terms of bicolored graphs with no isolates</a>, Environment and Planning, B 5 (1978), 31-43.
%H F. Harary, L. March and R. W. Robinson, <a href="/A007139/a007139.pdf">On enumerating certain design problems in terms of bicolored graphs with no isolates</a>, Environment and Planning B: Urban Analytics and City Science, 5 (1978), 31-43. [Annotated scanned copy]
%Y Row sums give A007140. Cf. A007139, A106498 (gives beginning of this triangle).
%K nonn,tabf
%O 0,13
%A _N. J. A. Sloane_, Nov 14 2006
|
