The well-known 1–2–3 Conjecture asserts that the edges of every graph without isolated can be weighted with 1, 2 and 3 so adjacent vertices receive distinct degrees . This is open in general, while it known to possible from weight set { 1 , 4 5 } We show for regular graphs sufficient use weights 2, 3, 4. Moreover, we prove conjecture hold d -regular ≥ 10 8