\((a,d)\)-distance antimagic labeling of some types of graphs

DOI10.1007/s10559-016-9897-zzbMath1355.05216OpenAlexW2554007700MaRDI QIDQ508583

Marina F. Semeniuta

Publication date: 7 February 2017

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

Full work available at URL: https://doi.org/10.1007/s10559-016-9897-z

zbMATH Keywords

pathregular graphcirculant graphdistance magic labeling\((a,d)\)-distance antimagic labelingdistance antimagic labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Local distance antimagic chromatic number for the union of star and double star graphs ⋮ On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs ⋮ Some results on (a,d)-distance antimagic labeling

Cites Work

• Distance magic circulant graphs
• Handicap distance antimagic graphs and incomplete tournaments
• Circulants and their connectivities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \((a,d)\)-distance antimagic labeling of some types of graphs