Weighted antimagic labeling

DOI10.1016/j.dam.2017.05.006zbMath1387.05226OpenAlexW2625099618MaRDI QIDQ1752499

José Zamora, Martin Matamala

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.05.006

zbMATH Keywords

complete bipartite graphgraph labelingantimagic labelingweighted antimagic labeling

Mathematics Subject Classification ID

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

Related Items (3)

Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ A lower bound and several exact results on the \(d\)-lucky number ⋮ Antimagic labeling of forests with sets of consecutive integers

Cites Work

• Unnamed Item
• Regular graphs are antimagic
• 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
• Regular Graphs of Odd Degree Are Antimagic
• 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