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

DOI10.1007/S10559-018-0031-2MaRDI QIDQ722058zbMATH OpenOpenAlexWikidataFDO

Authors 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 operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• \((a,d)\)-distance antimagic labeling of some types of graphs
• Distance antimagic labelings of graphs
• Bimagic vertex labelings
• Distance antimagic labelings of product graphs
• Upper bound limit analysis of plates utilizing the C1 natural element method

Cites work

• Bimagic labelling in path graphs
• Fair incomplete tournaments with odd number of teams and large number of games
• Handicap distance antimagic graphs and incomplete tournaments
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Magic Graphs
• Mathematics and sports
• Numbered complete graphs, unusual rulers, and assorted applications
• On 1-vertex bimagic vertex labeling
• On \((a,d)\)-distance antimagic graphs
• \((a,d)\)-distance antimagic labeling of some types of graphs

Cited in

(4)

• Group labeling of some graphs
• On \((a,d)\)-distance antimagic graphs
• Bimagic vertex labelings
• \((a,d)\)-distance antimagic labeling of some types of graphs

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

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