Vertex-clique incidence bigraph

Vertex-clique incidence bigraph --- двудольный граф вершины-клики.

The vertex-clique incidence bigraph of a graph [math]\displaystyle{ G }[/math] is a bigraph [math]\displaystyle{ VK(G) }[/math] with the vertices of [math]\displaystyle{ G }[/math] on one side and the cliques of [math]\displaystyle{ G }[/math] on the other side, such that a vertex [math]\displaystyle{ v }[/math] of [math]\displaystyle{ G }[/math] is adjacent to a clique [math]\displaystyle{ K }[/math] of [math]\displaystyle{ G }[/math] in [math]\displaystyle{ VK(G) }[/math] if and only if [math]\displaystyle{ v }[/math] is a member of [math]\displaystyle{ K }[/math] in [math]\displaystyle{ G }[/math].