Bipartite Graph
- Tags
- math
Is a Graph consisting of 2 sets of vertices \( X \) and \( Y \) such that the edges only join vertices from \( X \) to vertices in \( Y \). There aren't any edges connecting vertices in the same set to each other.
\begin{figure}
\centering
\begin{tikzpicture}
\node (l1) [draw, circle] {}; \node (r1) [draw, circle, right=of l1] {};
\node (l2) [draw, circle, below=of l1] {}; \node (r2) [draw, circle, below=of r1, right=of l2] {};
\node (l3) [draw, circle, below=of l2] {}; \node (r3) [draw, circle, below=of r2, right=of l3] {};
\node (l4) [draw, circle, below=of l3] {}; \node (r4) [draw, circle, below=of r3, right=of l4] {};
\node (l5) [draw, circle, below=of l4] {}; \node (r5) [draw, circle, below=of r4, right=of l5] {};
\draw (l1) -- (r1)
(l1) -- (r2)
(l2) -- (r2)
(l2) -- (r3)
(l3) -- (r3)
(l3) -- (r4)
(l3) -- (r5)
(l4) -- (r4)
(l4) -- (r5)
(l5) -- (r5);
\end{tikzpicture}
\caption{An example of a Bipartite graph with edges only connecting nodes on the
left hand side to the right hand side.}
\end{figure}