DISTANCE MAGIC LABELING FOR SOME PRODUCT GRAPHS

DISTANCE MAGIC LABELING FOR SOME PRODUCT GRAPHS

N. P. Shrimali, Y. M. Parmar, M. A. Patel

[PDF]

Abstract

In this paper, we prove Wt □ G and Wt ⊠ G are not distance magic if graph G contains two vertices with the same neighborhood. And we also prove Wt ×C4 (t ≥ 5), W3□Pn and W4 × Pn (n ≥ 3) are not distance magic graphs.

Keywords

Cartesian product, direct product, distance magic labeling, strong product.