Definition §

Bipartite Graphs

Bipartite Graphs are graphs whose Verticies can be split into distinct sets, a.k.a each Vertex does not have a Edge that connects to it to another Vertex of the same set as it.

It is a Complete Bipartite Graph if every member of one set is connected to every member of the other set.

Take the nubmer of verticies in the first group and times it with the nubmer of verticies in the second group.

Warning

Dont call the nodes in each set “not Interconnected”

Abstract Allocation

Bipartite graphs are useful for allocation

Examples of Bipartite / Non-Bipartite Graphs §

[!multi-column]

Example 1 - Bipartite Bi-Partite Graph Example 1.excalidraw

Example 2 - Bipartite Bi-Partite Graph Example 2.excalidraw

[!multi-column]

Example 3 - Non-Bipartite Bi-Partite Graph Example 3 Non-Bipart.excalidraw

[!success|wide-4] Example 4 - Bipartite Bi-Partite Graph Example 4 .excalidraw

[!multi-column]

[!faq|wide-2] Un-Coloured Example - Non-Bipartite Bi-Partite Graph Example 5 Unlabelled.excalidraw

Un-Coloured Example - Bipartite Bi-Partite Graph Example 6 Unlabelled.excalidraw