How do i approach this problem:
For which natural numbers $n$ there exists a simple, 2-regular graph with exactly $n$ vertices?
Hint: I believe that a simple, 2-regular graph with exactly n vertices is called an n-cycle.
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
1 year ago
Get the weekly newsletter!
see an example newsletter