Draw bipartite graph from adjacency matrix

A question is this type if and only if it asks to draw or construct a bipartite graph given an adjacency matrix showing connections between two sets.

2 questions · Easy -1.5

Sort by: Default | Easiest first | Hardest first
AQA D1 2012 January Q2
5 marks Easy -1.8
2
  1. Draw a bipartite graph representing the following adjacency matrix.
    \cline { 2 - 7 } \multicolumn{1}{c|}{}\(\mathbf { 1 }\)\(\mathbf { 2 }\)\(\mathbf { 3 }\)\(\mathbf { 4 }\)\(\mathbf { 5 }\)\(\mathbf { 6 }\)
    \(\boldsymbol { A }\)110011
    \(\boldsymbol { B }\)010011
    \(\boldsymbol { C }\)100011
    \(\boldsymbol { D }\)011101
    \(\boldsymbol { E }\)000011
    \(\boldsymbol { F }\)000001
  2. Given that \(A , B , C , D , E\) and \(F\) represent six people and that 1, 2, 3, 4, 5 and 6 represent six tasks to which they may be assigned, explain why a complete matching is impossible. \begin{verbatim} QUESTION PART REFERENCE \end{verbatim}
AQA D1 2010 June Q1
4 marks Easy -1.2
  1. Draw a bipartite graph representing the following adjacency matrix. [2 marks] $$\begin{array}{c|ccccc} & 1 & 2 & 3 & 4 & 5 \\ \hline A & 1 & 0 & 0 & 0 & 1 \\ B & 0 & 1 & 1 & 1 & 0 \\ C & 0 & 1 & 1 & 1 & 0 \\ D & 1 & 0 & 0 & 0 & 1 \\ E & 1 & 0 & 0 & 0 & 1 \\ \end{array}$$
  2. If \(A\), \(B\), \(C\), \(D\) and \(E\) represent five people and 1, 2, 3, 4 and 5 represent five tasks to which they are to be assigned, explain why a complete matching is impossible. [2 marks]