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.
Define a vertex in the context of a graph.
Think of it as the 'dots' on a diagram.
What does it mean for two vertices to be adjacent?
Look for direct connections.
What defines a complete graph?
Think about connections between nodes.
True or False: An undirected graph can have an odd number of vertices of odd degree.
Consider how edges contribute to vertex degrees.
Create a bipartite graph with 6 vertices, where 3 belong to one set and 3 to another. Ensure all vertices are connected.
Visualize how each group can only connect to the other group.
Demonstrate the handshaking theorem with a graph of your choice. Provide the degree of each vertex and verify the theorem.
List out the edges and their contributions to each vertex.
4 more questions in this section. Enroll free to practise them all.
Enroll free