2 research outputs found

    Orientable ℤ \u3c inf\u3e n -distance magic labeling of the Cartesian product of many cycles

    Get PDF
    The following generalization of distance magic graphs was introduced in [2]. A directed ℤn- distance magic labeling of an oriented graph G = (V,A) of order n is a bijection ℓ: V → ℤn with the property that there is a μ ∈ ℤ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 ℓ for G, we say that G is orientable ℤn-distance magic and the directed ℤn-distance magic labeling ℓ we call an orientable ℤn-distance magic labeling. In this paper, we find orientable ℤn- distance magic labelings of the Cartesian product of cycles. In addition, we show that even-ordered hypercubes are orientable ℤn-distance magic

    Orientable ℤN-Distance Magic Graphs

    No full text
    Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v
    corecore