Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How do i approach this problem:

For which natural numbers $n$ there exists a simple, 2-regular graph with exactly $n$ vertices?

share|cite|improve this question
up vote 2 down vote accepted

Hint: I believe that a simple, 2-regular graph with exactly n vertices is called an n-cycle.

share|cite|improve this answer
Thank you!. How about simple, 3-regular graph with exactly n vertices? – jenn3 Jan 31 '13 at 5:21
@jenn3 That's a separate question, but not hard either. – Calvin Lin Jan 31 '13 at 5:22
would this work for every n? how do i show that – jenn3 Jan 31 '13 at 5:35
The logic will work for every single $n$. For example, it suffices to consider: is there a 0-cylce? How about a 1-cycle? How about a 2-cycle? – Calvin Lin Jan 31 '13 at 5:40
Thanks again. For simple, 3-regular graph is basically called a cubic graph right? which exist for n >= 4 and even. – jenn3 Jan 31 '13 at 6:06

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.