## Abstract

A directed ℤ_{n}-distance magic labeling of an oriented graph G→ = (V,A) of order n is a bijection l→: V → ℤ_{n} with the property that there exists µ ∈ ℤ_{n} (called the magic constant) such that If for a graph G there exists an orientation G→ such that there is a directed ℤ_{n}-distance magic labeling l→ for G→, we say that G is orientable ℤ_{n}-distance magic. In this paper, we prove that the Cartesian product of any two cycles is orientable ℤ_{n}-distance magic.

Original language | English (US) |
---|---|

Pages (from-to) | 222-235 |

Number of pages | 14 |

Journal | Australasian Journal of Combinatorics |

Volume | 69 |

Issue number | 2 |

State | Published - 2017 |

### Bibliographical note

Publisher Copyright:© 2017, University of Queensland. All rights reserved.

## Fingerprint

Dive into the research topics of 'Orientable ℤ_{n}-distance magic labeling of the cartesian product of two cycles'. Together they form a unique fingerprint.