Regular Graphs of Odd Degree Are Antimagic

DOI10.1002/jgt.21836zbMath1321.05229arXiv1303.4850OpenAlexW1608199112MaRDI QIDQ2947855

Yu-Chang Liang, Daniel W. Cranston, Xuding Zhu

Publication date: 29 September 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

regularantimagic labelingodd degree

Mathematics Subject Classification ID

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

Related Items (30)

Antimagic Labeling of Regular Graphs ⋮ Antimagic labeling of some biregular bipartite graphs ⋮ Multi-bridge graphs are anti-magic ⋮ Antimagic orientations of graphs with given independence number ⋮ A note on additive choice number of planar graphs ⋮ Local antimagic orientation of graphs ⋮ Antimagic orientation of biregular bipartite graphs ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive integers ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ Regular graphs are antimagic ⋮ Antimagic orientation of graphs with minimum degree at least 33 ⋮ Antimagic orientation of forests ⋮ Local antimagic labeling of graphs ⋮ Generation of anti-magic graphs from binary graph products ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number ⋮ Caterpillars are antimagic ⋮ Partially magic labelings and the antimagic graph conjecture ⋮ Weighted antimagic labeling ⋮ A generalized version of a local antimagic labelling conjecture ⋮ Caterpillars with maximum degree 3 are antimagic ⋮ Antimagic orientations of graphs with large maximum degree ⋮ Antimagic labelings of caterpillars ⋮ Antimagic orientations for the complete \(k\)-ary trees ⋮ Shifted-antimagic labelings for graphs ⋮ Antimagic labeling of forests with sets of consecutive integers ⋮ Antimagic orientations of disconnected even regular graphs ⋮ A note on antimagic orientations of even regular graphs ⋮ Antimagic orientation of Halin graphs ⋮ List-antimagic labeling of vertex-weighted graphs ⋮ Antimagic labeling of biregular bipartite graphs

Cites Work

• Unnamed Item
• Antimagic Labeling of Cubic Graphs
• On Antimagic Labeling of Odd Regular Graphs
• An Application of the combinatorial Nullstellensatz to a graph labelling problem
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• Antimagic Properties of Graphs with Large Maximum Degree
• Anti‐magic graphs via the Combinatorial NullStellenSatz

This page was built for publication: Regular Graphs of Odd Degree Are Antimagic