1 research outputs found

    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