Publication Date
1-1-2021
Document Type
Article
Publication Title
Discrete Mathematics and Theoretical Computer Science
Volume
23
Issue
3
DOI
10.46298/DMTCS.5631
Abstract
A graph G is weighted-k-list-antimagic if for any vertex weighting →: V (G) → R and any list assignment L: E(G) → 2R with jL(e)j ≤ jE(G)j + k there exists an edge labeling f such that f(e) 2 L(e) for all e 2 E(G), labels of edges are pairwise distinct, and the sum of the labels on edges incident to a vertex plus the weight of that vertex is distinct from the sum at every other vertex. In this paper we prove that every graph on n vertices having no K1 or K2 component is weighted-4n 3 -list-antimagic.
Funding Number
DMS-1427526
Funding Sponsor
National Science Foundation
Keywords
Antimagic labeling, Combinatorial Nullstellensatz, List coloring, Weighted graph
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Department
Mathematics and Statistics
Recommended Citation
Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam, Victor Larsen, and Danny Rorabaugh. "List-antimagic labeling of vertex-weighted graphs" Discrete Mathematics and Theoretical Computer Science (2021). https://doi.org/10.46298/DMTCS.5631
