Weighted antimagic labeling: an algorithmic approach

DOI10.1016/j.endm.2015.07.022zbMath1347.05207OpenAlexW2206046964MaRDI QIDQ324749

José Zamora, Martin Matamala

Publication date: 17 October 2016

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

zbMATH Keywords

antimagic labelingweighted antimagic labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

Antimagic labelings of caterpillars

Cites Work

• Unnamed Item
• On anti-magic labeling for graph products
• Lattice grids and prisms are antimagic
• On zero-sum partitions and anti-magic trees
• Antimagic labelling of vertex weighted graphs
• An Application of the combinatorial Nullstellensatz to a graph labelling problem
• Dense graphs are antimagic
• 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: Weighted antimagic labeling: an algorithmic approach