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 defines a subgraph?
Think of a mini-version of a graph.
Does a proper subgraph equal the original graph?
Remember, proper means smaller.
What constitutes a proper subgraph?
Think of size comparisons.
True or False: Every subgraph is also an induced subgraph?
Consider selective inclusion in induced subgraphs.
Given two graphs, G and H with the same number of vertices but differing numbers of edges, prove they cannot be isomorphic.
Use the concept of edge mapping to illustrate this.
Construct a graph with at least one cut vertex and one cut edge, providing a clear identification of each and demonstrating their impact on connectivity upon their removal.
Focus on the roles these points play together in your graph layout.
6 more questions in this section. Enroll free to practise them all.
Enroll free