Triangle read by rows: T(n,k) is the number of graphs with n vertices with connected domination number k.
A286958
Triangle read by rows: T(n,k) is the number of graphs with n vertices with connected domination number k.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =2a(5) =11a(6) =8a(7) =2a(8) =34a(9) =62a(10) =14a(11) =2a(12) =156a(13) =514a(14) =163a(15) =18a(16) =2a(17) =1044a(18) =7147a(19) =2583a(20) =317a(21) =24a(22) =2a(23) =12346a(24) =170803a(25) =70667a(26) =6720a(27) =513a(28) =29a(29) =2
External references
- oeis: A286958