Note on group distance magic complete bipartite graphs |
| |
Authors: | Sylwia Cichacz |
| |
Institution: | 1. Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059, Kraków, Poland
|
| |
Abstract: | 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) = \sum\nolimits_{y \in N_G (x)} {\ell (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. Moreover we show that if p ≡ 2 (mod 4) and k is even, then there does not exist a group Γ of order p such that there exists a Γ-distance labeling for a k-partite complete graph of order p. We also prove that K m,n is a group distance magic graph if and only if n + m ? 2 (mod 4). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|