(a,d)-distance antimagic labeling of some types of graphs
DOI10.1007/S10559-016-9897-ZzbMATH Open1355.05216OpenAlexW2554007700MaRDI QIDQ508583FDOQ508583
Authors: 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
Recommendations
- On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs
- Upper bound limit analysis of plates utilizing the C1 natural element method
- On \((a,d)\)-distance antimagic graphs
- Some results on \((a,d)\)-distance antimagic labeling
- A study on \((a,d)\)-antimagic graphs using partition
distance magic labelingcirculant graphpathregular graph\((a,d)\)-distance antimagic labelingdistance antimagic labeling
Distance in graphs (05C12) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (8)
- On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs
- On \((a,d)\)-distance antimagic graphs
- Local distance antimagic chromatic number for the union of star and double star graphs
- Some results on \((a,d)\)-distance antimagic labeling
- Distance antimagic labelings of graphs
- Distance antimagic labeling of the ladder graph
- Local distance antimagic chromatic number for the union of complete bipartite graphs
- A study on \((a,d)\)-antimagic graphs using partition
This page was built for publication: \((a,d)\)-distance antimagic labeling of some types of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508583)
