I'm having a hard time seeing what $C_n$ would be for $n = 1$, or $n = 2$. Can someone clear up my confusion?
Tell me more
×
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.
|
|
||||
|
|
|
For $n\geq 3$, the cycle graph $C_n$ is the unique connected graph of order $n$ such that $\deg(u)=2$ for all vertices $u$. Note that $C_n$ is simple, that is, $C_n$ does not have loops or multiple edges. So if you want to define $C_2$; if you want it to be a connected graph of order $2$ such that $\deg(u)=2$ for all vertices, then there will be multiple edges joining the two vertices of $C_2$. In particular, it is not simple. If you want $C_2$ to be connected and simple, then $C_2$ must be a tree. So $\deg(u)=1$ for all vertices $u$. Similarly, for $C_1$, if you want it to be a connected graph of order $1$ such that $\deg(u)=2$ for all vertices, then there will be a loop at the single vertex of $C_1$. In particular, it is not simple. So normally we only talk about $C_n$ when $n\geq 3$. |
|||
|
|
|
$C_n$ is only defined for $n\geq 3$ because with $n=2$ or $n=1$ by definition you would have a tree without cycles. |
|||||
|
