Consider a "Feasibility Matrix" \(M\) for all \(n, m \geq 1\), where an entry \(M_{n,m}\) is equal to 1 if a planar layout for the graph \(K_{n,m}\) is possible, and equal to 0 otherwise. Which of the following statements is true?
a) \(M_{n,m} = 0\) for all cases where \(n + m > 5\).
b) \(M_{2,m} = 1\) for all \(m \geq 1\).
c) The graph \(K_{3,3}\) is planar because it is possible to draw it in a 2D plane without any edges intersecting.
d) Every graph \(K_{n,m}\) is planar as long as \(n \neq m\).
e) None of the above
Original idea by: Luis Alberto Vásquez Vargas
No comments:
Post a Comment