Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
What is the complement of a complete graph with 3 vertices?
Consider what edges would exist.
Define a tree in your own words.
Think about connections and loops.
What is the definition of a graph?
Think about how graphs represent relationships.
True or False: The complement of graph G contains all edges from G.
Remember the definition of a complement.
Construct a graph with 10 vertices that is self-complementary and verify its properties.
Utilize the 4k + 1 framework.
Demonstrate, through example, how the removal of an edge in a tree splits it into two components.
Remember that trees are connected, and removing edges has specific consequences.
6 more questions in this section. Enroll free to practise them all.
Enroll free