No Registration Required

# Graph Theory Mastery Quiz

### 1. What is the degree of a vertex in a graph?

### 2. In a complete graph with 5 vertices, how many edges are there?

### 3. What is the Handshaking Lemma?

### 4. Which theorem establishes a necessary and sufficient condition for a graph to be Eulerian?

### 5. What is the main difference between Euler paths and Hamiltonian paths?

### 6. Which property must a graph have to be considered bipartite?

### 7. What does it mean for a graph to be 'connected'?

### 8. What is the significance of Planar Graphs in Graph Theory?

### 9. In the context of Graph Theory, what is a 'tree'?

### 10. What theorem helps determine if a graph is Hamiltonian?