Triangle read by rows: T(n,k) is the number of disconnected permutation graphs on n vertices with domination number k, with 2 <= k <= n.
A320579
Triangle read by rows: T(n,k) is the number of disconnected permutation graphs on n vertices with domination number k, with 2 <= k <= n.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =7a(4) =3a(5) =1a(6) =26a(7) =18a(8) =4a(9) =1a(10) =115a(11) =111a(12) =27a(13) =5a(14) =1a(15) =592a(16) =771a(17) =186a(18) =37a(19) =6a(20) =1a(21) =3532a(22) =5906a(23) =1459a(24) =274a(25) =48a(26) =7a(27) =1a(28) =24212a(29) =49982
External references
- oeis: A320579