FindGraphPartition

FindGraphPartition[g] gives a partition of vertices of the graph g.

FindGraphPartition[g,k] gives a partition of vertices into k approximately equal-size parts.

FindGraphPartition[g,{n1,…,nk}] gives a partition of vertices into parts with sizes n1, …, nk.

FindGraphPartition[g,{α1,…,αk}] gives a partition of vertices into parts with approximate size proportions α1, …, αk.

FindGraphPartition[{v->w,…},…] uses rules v->w to specify the graph g.

Please visit the official Wolfram Language Reference for more details and examples on core symbols.