@article {
author = {Mojdeh, D. A. and Samadi, B. and Hosseini Moghaddam, S. M.},
title = {Bounds on the signed distance--domination number of graphs},
journal = {Iranian Journal of Science and Technology (Sciences)},
volume = {36},
number = {Issue 3.1},
pages = {367-370},
year = {2014},
publisher = {Springer},
issn = {1028-6276},
eissn = {},
doi = {10.22099/ijsts.2014.2088},
abstract = {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.},
keywords = {Signed distance--dominating function,th power of a graph},
url = {http://ijsts.shirazu.ac.ir/article_2088.html},
eprint = {http://ijsts.shirazu.ac.ir/article_2088_c5af88b0160d6586dccc3fe99fa04e5f.pdf}
}