List-antimagic labeling of vertex-weighted graphs

DOI10.46298/dmtcs.5631zbMath1489.05122arXiv1510.05070OpenAlexW4206754934MaRDI QIDQ5024668

Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam, Danny Rorabaugh, Victor Larsen

Publication date: 27 January 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.05070

zbMATH Keywords

weighted graphlist coloringcombinatorial Nullstellensatzantimagic labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Regular graphs are antimagic
• A dynamic survey of graph labeling
• Antimagic orientation of biregular bipartite graphs
• Caterpillars with maximum degree 3 are antimagic
• Antimagic labelings of caterpillars
• Caterpillars are antimagic
• Antimagic orientations of disconnected even regular graphs
• A note on antimagic orientations of even regular graphs
• Antimagic orientations of graphs with given independence number
• LAUGHLIN'S WAVE FUNCTIONS, COULOMB GASES AND EXPANSIONS OF THE DISCRIMINANT
• Graphs of Large Linear Size Are Antimagic
• Antimagic labelling of vertex weighted graphs
• Regular Graphs of Odd Degree Are Antimagic
• On antimagic directed graphs
• Antimagic Labeling of Regular Graphs
• Combinatorial Nullstellensatz
• Antimagic Properties of Graphs with Large Maximum Degree
• Anti‐magic graphs via the Combinatorial NullStellenSatz

This page was built for publication: List-antimagic labeling of vertex-weighted graphs