Antimagic labeling and canonical decomposition of graphs

DOI10.1016/j.ipl.2010.01.006zbMath1197.05124OpenAlexW2050399605MaRDI QIDQ991774

Michael D. Barrus

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.01.006

zbMATH Keywords

split graphcombinatorial problemscanonical decompositionantimagic labeling

Mathematics Subject Classification ID

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

Related Items (7)

On edge-graceful labeling and deficiency for regular graphs ⋮ Unnamed Item ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive integers ⋮ \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Antimagic labeling graphs with a regular dominating subgraph

Cites Work

• Unnamed Item
• Unnamed Item
• On anti-magic labeling for graph products
• Lattice grids and prisms are antimagic
• The splittance of a graph
• Decomposition of graphical sequences and unigraphs
• The A4-structure of a graph
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics

This page was built for publication: Antimagic labeling and canonical decomposition of graphs