Graph antimagic labeling: a survey

DOI10.1142/S1793830923300023zbMATH Open1537.05026MaRDI QIDQ6542943FDOQ6542943

Zhuojie Tu, Jingxiang Jin

Publication date: 23 May 2024

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

antimagic labelingantimagic orientation\(k\)-antimagic labeling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On zero-sum partitions and anti-magic trees
• Antimagic labelling of vertex weighted graphs
• Combinatorial Nullstellensatz
• Weighted-1-antimagic graphs of prime power order
• Weighted antimagic labeling
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• Antimagic Properties of Graphs with Large Maximum Degree
• ANTIMAGIC LABELING OF DIGRAPHS
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• On anti-magic labeling for graph products
• Antimagic labeling of some biregular bipartite graphs
• On the antimagic labeling of star forests
• Antimagic labeling of cubic graphs
• On Antimagic Labeling of Odd Regular Graphs
• On antimagic directed graphs
• Antimagic Labeling of Regular Graphs
• Anti-magic labeling of trees
• Antimagic labeling of new classes of trees
• A new class of antimagic Cartesian product graphs
• On Antimagic Labeling for Generalized Web and Flower Graphs
• A class of antimagic join graphs
• Regular graphs are antimagic
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientation of lobsters
• Antimagic orientations of graphs with large maximum degree
• Caterpillars are antimagic
• Antimagic orientations for the complete \(k\)-ary trees
• A note on antimagic orientations of even regular graphs
• Antimagic orientation of Halin graphs
• Graphs of large linear size are antimagic
• Antimagic orientations of even regular graphs
• Antimagic orientation of graphs with minimum degree at least 33
• Antimagic orientation of subdivided caterpillars
• Regular Graphs of Odd Degree Are Antimagic
• Local antimagic vertex coloring of a graph
• Antimagic labelings of join graphs
• Local antimagic orientations of \(d\)-degenerate graphs
• Local antimagic orientation of graphs
• On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
• Proof of a local antimagic conjecture
• Antimagic labeling of forests with sets of consecutive integers
• Anti-magic labelling of Cartesian product of graphs
• Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
• Caterpillars with maximum degree 3 are antimagic
• Local antimagic labeling of graphs
• Caterpillars Have Antimagic Orientations
• Shifted-antimagic labelings for graphs
• Trees whose even-degree vertices induce a path are antimagic
• Antimagic orientations of graphs with given independence number
• Antimagic labelings of cycle powers.

This page was built for publication: Graph antimagic labeling: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542943)