Tags: #definition

complete bipartite graph

The complete bipartite graph $K_{m,n}$ is the graph on $n,m$ vertices where we partition them into a set of $n$ and a set of $m$, and the edges consist of all possible edges between these two sets (with no edges within).

Properties

• $f_{\overline{K_n\bigsqcup K_m}}(x)=(x+m+n)(x+n{)}^{m-1}(x+m{)}^{n-1}$ (see example section of this)