Graphs admitting antimagic labeling for arbitrary sets of positive numbers

DOI10.1016/J.DAM.2019.10.011zbMATH Open1440.05177OpenAlexW2981642040WikidataQ126975779 ScholiaQ126975779MaRDI QIDQ2184690FDOQ2184690

Authors: José Zamora, Martin Matamala 

Publication date: 29 May 2020

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

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

Recommendations

• Graphs admitting antimagic labeling for arbitrary sets of positive integers
• Antimagic labelling of vertex weighted graphs
• Weighted antimagic labeling: an algorithmic approach
• Weighted antimagic labeling
• Totally antimagic total graphs

zbMATH Keywords

split graphscomplete bipartite graphsantimagic graphs

Mathematics Subject Classification ID

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

Cites Work

• Antimagic labelling of vertex weighted graphs
• Lattice grids and prisms are antimagic
• Weighted antimagic labeling
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• Title not available (Why is that?)
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics
• On anti-magic labeling for graph products
• Antimagic labeling and canonical decomposition of graphs
• Antimagic labeling of cubic graphs
• Antimagic labeling of regular graphs
• Anti-magic labeling of trees
• Antimagic labeling graphs with a regular dominating subgraph
• Regular graphs of odd degree are antimagic
• Title not available (Why is that?)

Cited In (5)

• Antimagic labeling of forests with sets of consecutive integers
• Graphs admitting antimagic labeling for arbitrary sets of positive integers
• Antimagic labelling of vertex weighted graphs
• Weighted antimagic labeling
• Labeling trees of small diameters with consecutive integers

This page was built for publication: Graphs admitting antimagic labeling for arbitrary sets of positive numbers

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