TY - JOUR
ID - 2088
TI - Bounds on the signed distance--domination number of graphs
JO - Iranian Journal of Science and Technology (Sciences)
JA - IJSTS
LA - en
SN - 1028-6276
AU - Mojdeh, D. A.
AU - Samadi, B.
AU - Hosseini Moghaddam, S. M.
AD - Department of Mathematics, University of Tafresh, Tafresh, Iran
AD - School of Mathematics, Institute for Research in Fundamental
Sciences (IPM) Tehran, Iran, P.O. Box 19395-5746
AD - Shahab Danesh Institute of Higher Education, Qom, Iran
Y1 - 2014
PY - 2014
VL - 36
IS - Issue 3.1
SP - 367
EP - 370
KW - Signed distance--dominating function
KW - th power of a graph
DO - 10.22099/ijsts.2014.2088
N2 - Let , 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.
UR - http://ijsts.shirazu.ac.ir/article_2088.html
L1 - http://ijsts.shirazu.ac.ir/article_2088_c5af88b0160d6586dccc3fe99fa04e5f.pdf
ER -