Local antimagic labeling of graphs

DOI10.1016/j.amc.2017.10.008zbMath1426.05149OpenAlexW2771852132MaRDI QIDQ2423101

Xiaowei Yu, Jie Hu, Donglei Yang, Jian Liang Wu, Guang-Hui Wang

Publication date: 21 June 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.10.008

zbMATH Keywords

labelingcombinatorial nullstellensatzantimagic labelinglocal antimagic labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07)

Related Items (6)

A note on additive choice number of planar graphs ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number ⋮ On local antimagic chromatic number of cycle-related join graphs ⋮ Unnamed Item ⋮ Antimagic orientation of lobsters ⋮ Product antimagic labeling of caterpillars

Cites Work

• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing total colorings of planar graphs
• Regular graphs are antimagic
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• A dynamic survey of graph labeling
• Local antimagic orientations of \(d\)-degenerate graphs
• Local antimagic vertex coloring of a graph
• Antimagic labelling of vertex weighted graphs
• Regular Graphs of Odd Degree Are Antimagic
• Dense graphs are antimagic
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
• Regular bipartite graphs are antimagic
• Combinatorial Nullstellensatz
• Antimagic Properties of Graphs with Large Maximum Degree
• Anti‐magic graphs via the Combinatorial NullStellenSatz

This page was built for publication: Local antimagic labeling of graphs