Graphs admitting antimagic labeling for arbitrary sets of positive integers

DOI10.1016/j.endm.2017.10.028zbMath1383.05286OpenAlexW2767153232MaRDI QIDQ2413165

José Zamora, Martin Matamala

Publication date: 9 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.028

zbMATH Keywords

split graphscomplete bipartite graphsantimagic graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Anti-magic labeling of trees
• Antimagic labeling graphs with a regular dominating subgraph
• On anti-magic labeling for graph products
• Antimagic labeling and canonical decomposition of graphs
• Lattice grids and prisms are antimagic
• Antimagic Labeling of Cubic Graphs
• Antimagic labelling of vertex weighted graphs
• Regular Graphs of Odd Degree Are Antimagic
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Regular bipartite graphs are antimagic
• Combinatorial Nullstellensatz
• Antimagic Properties of Graphs with Large Maximum Degree
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics

This page was built for publication: Graphs admitting antimagic labeling for arbitrary sets of positive integers