A generalized version of a local antimagic labelling conjecture

DOI10.1007/s00373-018-1936-2zbMath1402.05186OpenAlexW2888636119WikidataQ122920638 ScholiaQ122920638MaRDI QIDQ1756104

Kasper Szabo Lyngsie, Liang Zhong

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1936-2

zbMATH Keywords

antimagic labellinglocal antimagic labellingneighbour sum distinguishing edge weightings

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Regular graphs are antimagic
• Local antimagic vertex coloring of a graph
• Graphs of Large Linear Size Are Antimagic
• Regular Graphs of Odd Degree Are Antimagic
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
• Proof of a local antimagic conjecture
• Antimagic Properties of Graphs with Large Maximum Degree

This page was built for publication: A generalized version of a local antimagic labelling conjecture