Weighted antimagic labeling: an algorithmic approach

DOI10.1016/J.ENDM.2015.07.022MaRDI QIDQ324749zbMATH OpenOpenAlexFDO

Authors 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 algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Weighted antimagic labeling
• Antimagic labelling of vertex weighted graphs
• scientific article; zbMATH DE number 5026374
• Publication:4862899
• List-antimagic labeling of vertex-weighted graphs
• scientific article; zbMATH DE number 2208450
• Magic and antimagic graphs. Attributes, observations and challenges in graph labelings
• Antimagic labeling of digraphs
• Computing edge weights of magic labeling on rooted products of graphs
• Further results on antimagic graph labelings

Cites work

• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• An application of the combinatorial nullstellensatz to a graph labelling problem
• Antimagic labelling of vertex weighted graphs
• Antimagic properties of graphs with large maximum degree
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Combinatorial Nullstellensatz
• Computing and Combinatorics
• Dense graphs are antimagic
• Lattice grids and prisms are antimagic
• On anti-magic labeling for graph products
• On zero-sum partitions and anti-magic trees
• Regular bipartite graphs are antimagic

Cited in

(4)

• Antimagic labelings of caterpillars
• Weighted antimagic labeling
• Antimagic labelling of vertex weighted graphs
• Graphs admitting antimagic labeling for arbitrary sets of positive numbers

This page was built for publication: Weighted antimagic labeling: an algorithmic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324749)