Construct a simple undirected graph G = (V,E) with the following property:
If you take any set X that is a maximal independent set of G, then X is not a minimum dominating set of G.
You can search course by course code or part of the course code, course name, part of the course name .
word - find any match of this word within the text.+ word - only exact matching words will be found.- word - don't include results containing this word.
Teacher can also add Tags to course.