Displaying similar documents to “Integral Cayley graphs defined by greatest common divisors.”

Note on group distance magic complete bipartite graphs

Sylwia Cichacz (2014)

Open Mathematics

Similarity:

A Γ-distance magic labeling of a graph G = (V, E) with |V| = n is a bijection ℓ from V to an Abelian group Γ of order n such that the weight w ( x ) = ∑ y ∈ N G ( x ) ℓ ( y ) of every vertex x ∈ V is equal to the same element µ ∈ Γ, called the magic constant. A graph G is called a group distance magic graph if there exists a Γ-distance magic labeling for every Abelian group Γ of order |V(G)|. In this paper we give necessary and sufficient conditions for complete k-partite graphs of odd order p to be ℤp-distance magic....