A proof of the multiplicative 1-2-3 conjecture (Q6057483): Difference between revisions

The well known \(1-2-3\) conjecture states that for each graph without a component \(K_{2}\) there is a labeling of its edges by numbers \(1,2,3\) such that no two adjacent vertices are incident to the same sum of labels. In the paper under review the authors prove that the ``product'' version of the conjecture is true for each graph of order at least 3; this answers in the affirmative the conjecture of \textit{J. Skowronek-Kaziów} [Inf. Process. Lett. 112, No. 5, 191--194 (2012; Zbl 1239.05085)].