The number of ordered pairs (G,S) where G is a simple labeled graph of order n and S is a subset of the vertices of G such that every element (vertex) in S is in the same connected component of G.
A249754
The number of ordered pairs (G,S) where G is a simple labeled graph of order n and S is a subset of the vertices of G such that every element (vertex) in S is in the same connected component of G.
Terms
- a(0) =1a(1) =2a(2) =7a(3) =51a(4) =814a(5) =27562a(6) =1881132a(7) =252352192a(8) =66437453648
External references
- oeis: A249754