Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

What is a 2-regular graph? Is is the same thing as an 2-connected graph where a 2-connected graph is a graph G such that G-V ( G minus a vertex V) is still connected?

share|cite|improve this question
Did you not try Wikipedia? – Rahul Apr 7 '11 at 6:45
up vote 4 down vote accepted

A regular graph is a graph where each vertex has the same degree. So a 2-regular graph is a graph where every vertex has degree 2. It is not the same as a 2-connected graph, since a 2-regular graph doesn't even have to be connected in the first place. For instance, it could be a graph whose components are two disconnected cycles. Conversely, the tetrahedral graph is 2-connected, but not 2-regular, as every vertex has degree $3$.

In general, a $k$-regular graph is one where every vertex has degree $k$.

share|cite|improve this answer
Yes your answer sparked my memory thank you. – lampShade Apr 7 '11 at 7:04

So now you know what a $k$-regular graph is, but what do you think in particular a 2-regular graph looks like?

Certainly, all cycle graphs are 2-regular, but that's not all of them...what other graphs are 2-regular but not a cycle? (think about integer partitions of $n$)

share|cite|improve this answer

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.