Weighted antimagic labeling: an algorithmic approach

DOI10.1016/J.ENDM.2015.07.022zbMATH Open1347.05207OpenAlexW2206046964MaRDI QIDQ324749FDOQ324749

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

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

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)

Cites Work

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

Cited In (4)

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

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)