Triangle T(n,k) of the number of unlabeled graphs on n nodes with existential reconstruction number k, 3<=k<=n. ERN(G) is the minimum number of vertex-deleted subgraphs of G required to uniquely reconstruct G up to isomorphism.
A124002
Triangle T(n,k) of the number of unlabeled graphs on n nodes with existential reconstruction number k, 3<=k<=n. ERN(G) is the minimum number of vertex-deleted subgraphs of G required to uniquely reconstruct G up to isomorphism.
Terms
- a(0) =4a(1) =8a(2) =3a(3) =34a(4) =0a(5) =0a(6) =150a(7) =4a(8) =2a(9) =0a(10) =1044a(11) =0a(12) =0a(13) =0a(14) =0a(15) =12334a(16) =8a(17) =2a(18) =2a(19) =0a(20) =0a(21) =274666a(22) =0a(23) =2a(24) =0a(25) =0a(26) =0a(27) =0a(28) =12005156a(29) =6
External references
- oeis: A124002