On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs

DOI10.1007/s10559-018-0031-2zbMath1391.05223OpenAlexW2795584594WikidataQ130012490 ScholiaQ130012490MaRDI QIDQ722058

D. Kharzeev

Publication date: 20 July 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0031-2

zbMATH Keywords

corona\(n\)-dimensional cubedistance magic labeling\((a, d)\)-distance antimagic labeling1-vertex bimagic vertex labeling

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Bimagic vertex labelings ⋮ Group labeling of some graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \((a,d)\)-distance antimagic labeling of some types of graphs
• Handicap distance antimagic graphs and incomplete tournaments
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Numbered complete graphs, unusual rulers, and assorted applications
• On 1-vertex bimagic vertex labeling
• Magic Graphs

This page was built for publication: On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs