Lattice grids and prisms are antimagic
From MaRDI portal
Publication:1022588
DOI10.1016/j.tcs.2006.12.003zbMath1162.05040arXivmath/0603106OpenAlexW1989878566MaRDI QIDQ1022588
Publication date: 22 June 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603106
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Antimagic labelling of vertex weighted graphs ⋮ On edge-graceful labeling and deficiency for regular graphs ⋮ Weighted antimagic labeling: an algorithmic approach ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive integers ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Weighted-1-antimagic graphs of prime power order ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ Weighted antimagic labeling ⋮ Approximate results for rainbow labelings ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Antimagic labelings of caterpillars ⋮ Labelings of plane graphs containing Hamilton path ⋮ Antimagic labeling and canonical decomposition of graphs ⋮ A new class of antimagic Cartesian product graphs ⋮ The antimagicness of the Cartesian product of graphs
Cites Work
