Distance antimagic labeling of join and corona of two graphs

DOI10.1016/J.AKCEJ.2017.04.003MaRDI QIDQ2409760zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 13 October 2017

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.akcej.2017.04.003

zbMATH Keywords

arbitrarily distance antimagic labelingdistance antimagic labelingdistance magic labeling

Mathematics Subject Classification ID

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

Recommendations

• Distance antimagic labelings of Cartesian product of graphs
• Distance antimagic graphs
• Distance antimagic labeling of the ladder graph
• Some results on (a,d)-distance antimagic labeling
• Distance antimagic labelings of graphs

Cites work

• Distance antimagic graphs
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 6273983 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• Some distance antimagic labeled graphs

Cited in

(10)

• Distance antimagic labeling of the ladder graph
• Some distance antimagic labeled graphs
• Distance antimagic graphs
• Some results on (a,d)-distance antimagic labeling
• Distance antimagic labelings of Cartesian product of graphs
• Distance antimagic labelings of product graphs
• Local distance antimagic chromatic number for the union of star and double star graphs
• Local distance antimagic chromatic number for the union of complete bipartite graphs
• The antimagic orientations for graphs obtained by some graph operations
• D-irregularity strength of a graph

This page was built for publication: Distance antimagic labeling of join and corona of two graphs

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