Minimal Sum Labeling of Graphs
Mat\v{e}j Kone\v{c}n\'y, Stanislav Ku\v{c}era, Jana Novotn\'a, Jakub, Pek\'arek, \v{S}t\v{e}p\'an \v{S}imsa, Martin T\"opfer

TL;DR
This paper investigates the properties of sum graphs, showing that relaxing certain conditions leads to the existence of sum graphs without minimal labelings, addressing a question from 1998.
Contribution
It demonstrates that relaxing injectivity or loop conditions in sum graphs can result in graphs lacking minimal labelings, answering a long-standing open question.
Findings
Sum graphs without minimal labelings exist under relaxed conditions.
Relaxing injectivity or allowing loops affects the existence of minimal labelings.
Partially answers the question posed by Miller, Ryan, and Smyth in 1998.
Abstract
A graph is called a sum graph if there is a so-called sum labeling of , i.e. an injective function such that for every it holds that if and only if there exists a vertex such that . We say that sum labeling is minimal if there is a vertex such that . In this paper, we show that if we relax the conditions (either allow non-injective labelings or consider graphs with loops) then there are sum graphs without a minimal labeling, which partially answers the question posed by Miller, Ryan and Smyth in 1998.
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.
