Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
Define what a subgraph is.
Remember that a subgraph must come from a larger graph.
What is a proper subgraph?
Think about what 'proper' means in terms of inclusion.
What is a proper subgraph?
Think about what 'proper' implies regarding size.
True or False: Two graphs can be isomorphic if they have different numbers of edges.
Recall the definition of isomorphism.
Design two undirected graphs that are isomorphic, then find a suitable bijection between their vertex sets.
Focus on maintaining edge connections when creating bijections.
Create a graph exhibiting properties that prevent it from being isomorphic to another, focusing on unique vertex degrees.
Consider how vertex degrees affect the ability to find isomorphic matches.
4 more questions in this section. Enroll free to practise them all.
Enroll free