Contents

-

Distance Two Vertex-Magic Graphs

Ebrahim Salehi1
1Department of Mathematical Sciences University of Nevada Las Vegas Las Vegas, NV 89154-4020

Abstract

Given an abelian group A, a graph G=(V,E) is said to have a distance two magic labeling in A if there exists a labeling l:E(G)A{0} such that the induced vertex labeling l:V(G)A defined by

l(v)=cE(v)l(e)

is a constant map, where E(v)={eE(G):d(v,e)<2}. The set of all hZ+, for which G has a distance two magic labeling in Zh, is called the distance two magic spectrum of G and is denoted by ΔM(G). In this paper, the distance two magic spectra of certain classes of graphs will be determined.

Keywords: Distance k magic; Distance & magic spectrum. 2000 Mathematics Subject Classification: 05C73