Ononot — Consider a simple graph G where every vertex has a degree of

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theoryeasy

0:00.0

Consider a simple graph $G$ where every vertex has a degree of exactly 1. If $G$ has $n$ vertices, what must be true about $n$ ?