SpringerIranian Journal of Science and Technology (Sciences)1028-627636Issue 3.120140901Bounds on the signed distance--domination number of graphs367370208810.22099/ijsts.2014.2088END. A.MojdehDepartment of Mathematics, University of Tafresh, Tafresh, IranB.SamadiSchool of Mathematics, Institute for Research in Fundamental
Sciences (IPM) Tehran, Iran, P.O. Box 19395-5746S. M.Hosseini MoghaddamShahab Danesh Institute of Higher Education, Qom, IranJournal Article20111105Let , be a graph with vertex set of order and edge set . A -dominating set of is a subset such that each vertex in has at least neighbors in . If is a vertex of a graph , the open -neighborhood of , denoted by , is the set , . is the closed -neighborhood of . A function 1, 1 is a signed distance- dominating function of , if for every vertex , Σ 1. The signed distance--domination number, denoted by ,, is the minimum weight of a signed distance--dominating function of . In this paper, we give lower and upper bounds on , of graphs. Also, we determine the signed distance--domination number of graph , (the graph obtained from the disjoint union by adding the edges , ) when 2.http://ijsts.shirazu.ac.ir/article_2088_c5af88b0160d6586dccc3fe99fa04e5f.pdf