A Conjecture on Zero-sum 3-magic Labeling of 5-regular Graphs
Guanghuang Dong, Ning Wang

TL;DR
This paper proves that every 5-regular graph can be labeled with three numbers such that the sum at each vertex is zero, confirming a previously posed conjecture in graph theory.
Contribution
It establishes that all 5-regular graphs admit a zero-sum 3-magic labeling, resolving an open conjecture in the field.
Findings
All 5-regular graphs have zero-sum 3-magic labelings.
Confirmed the conjecture by Akbari, Rahmati, and Zare.
Provides a constructive proof for the labeling existence.
Abstract
In this paper, we obtained that every 5-regular graph admits a zero-sum 3-magic labeling, which give an affirmative answer to a conjecture proposed by Saieed Akbari, Farhad Rahmati and Sanaz Zare in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Blockchain Technology in Education and Learning
