A general solution for the 1-2 conjecture using real numbers

Abstract: The 1-2 conjecture posits that for every graph, weights from ${1,2}$ can be assigned to its vertices and edges so that adjacent vertices have distinct weighted degrees. This paper demonstrates that any set of two distinct real numbers ${a,b}$ can achieve the same goal, thereby confirming the 1-2 conjecture in a broader context.