On Labeling the Union of Two Cycles

Abstract

It is conjectured that any 2-regular graph $G$ with $n$ edges has a $\rho$-labeling (and thus divides $K_{2n+1}$ cyclically). In this note, we show that the conjecture holds when $G$ has at most two components.