Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
Define a regular graph.
Consider the degree of vertices.
What is a cut edge?
Think about the connectivity of the graph.
What defines a regular graph?
Think about how degrees are distributed.
True or False: A cut edge must be removed to keep the graph connected.
Consider the impact of removing edges.
Design a regular graph of degree 4 that contains at least one cut edge, detailing the steps taken.
Consider the implications of each cut edge and how it affects the degree of connected vertices.
Explain how you can convert a regular graph into a bipartite graph while ensuring it remains regular.
Focus on how edges will connect vertices across two clear partitions.
4 more questions in this section. Enroll free to practise them all.
Enroll free