Triangle T(n,k) of the number of unlabeled graphs on n nodes with universal reconstruction number k, 3<=k<=n. URN(G) is the minimum size for which all multisubsets of vertex-deleted subgraphs of G can uniquely reconstruct G up to isomorphism.
A124003
Triangle T(n,k) of the number of unlabeled graphs on n nodes with universal reconstruction number k, 3<=k<=n. URN(G) is the minimum size for which all multisubsets of vertex-deleted subgraphs of G can uniquely reconstruct G up to isomorphism.
Terms
- a(0) =3a(1) =2a(2) =9a(3) =7a(4) =19a(5) =8a(6) =8a(7) =56a(8) =90a(9) =2a(10) =16a(11) =496a(12) =520a(13) =12a(14) =0a(15) =266a(16) =8308a(17) =3584a(18) =284a(19) =4a(20) =0a(21) =45186a(22) =199247a(23) =28781a(24) =1434a(25) =20a(26) =0a(27) =0a(28) =6054148a(29) =5637886
External references
- oeis: A124003