Figueroa-Centeno et al.'s product antimagic conjecture
Let be a connected graph of size . A labeling of its edges by is product antimagic if the products of the labels incident with the vertices are pairwise distinct. Figueroa-Centeno et al.'s product antimagic conjecture. Every connected graph of size at least three is product antimagic. Product antimagic labelings were introduced by Figueroa-Centeno et al.; the conjecture is presented as an open variation of the antimagic graph problem.
References
Primary source
Mercè Mora and Joaquín Tey, “Antimagic and product antimagic graphs with pendant edges”, arXiv:2405.05375 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.