Antimagic Labeling of Regular Graphs
From MaRDI portal
Publication:3188668
DOI10.1002/jgt.21905zbMath1372.05186arXiv1505.07688OpenAlexW2592055188MaRDI QIDQ3188668
Yu-Chang Liang, Fei-Huang Chang, Xuding Zhu, Zhishi Pan
Publication date: 12 August 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.07688
Related Items (37)
Antimagic orientation of subdivided caterpillars ⋮ 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 ⋮ Labeling trees of small diameters with consecutive integers ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number ⋮ Finding Antimagic Labelings of Trees by Evolutionary Search ⋮ Antimagic labeling for unions of graphs with many three-paths ⋮ Lexicographic product graphs \(P_m[P_n\) are antimagic] ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ Partially magic labelings and the antimagic graph conjecture ⋮ Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)] ⋮ A generalized version of a local antimagic labelling conjecture ⋮ Caterpillars with maximum degree 3 are antimagic ⋮ Antimagic orientation of lobsters ⋮ Antimagic orientations of graphs with large maximum degree ⋮ Antimagic labelings of caterpillars ⋮ Antimagicness of lexicographic product graph \(G[P_n\)] ⋮ Antimagic orientations for the complete \(k\)-ary trees ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ Shifted-antimagic labelings for graphs ⋮ Product antimagic labeling of caterpillars ⋮ 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
- Anti-magic labeling of trees
- On zero-sum partitions and anti-magic trees
- Anti-magic labelling of Cartesian product of graphs
- Antimagic Labeling of Cubic Graphs
- Regular Graphs of Odd Degree Are Antimagic
- Dense graphs are antimagic
- Regular bipartite graphs are antimagic
- Anti‐magic graphs via the Combinatorial NullStellenSatz
This page was built for publication: Antimagic Labeling of Regular Graphs
