(a,d)-distance antimagic labeling of some types of graphs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1998306 (Why is no real title available?)
- Circulants and their connectivities
- Distance magic circulant graphs
- Fair incomplete tournaments with odd number of teams and large number of games
- Handicap distance antimagic graphs and incomplete tournaments
- Mathematics and sports
- On \((a,d)\)-distance antimagic graphs
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
- A study on \((a,d)\)-antimagic graphs using partition
- Local distance antimagic chromatic number for the union of complete bipartite graphs
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)
