There is a set of vertices and it is divided into $k$ independent sets. The cardinalities of these sets are following: $a_{1},a_{2},...,a_{k}$
How many non-isomorphic graphs determined on these sets are there?
I hope that someone will help me.
Regards.