| تعداد نشریات | 24 |
| تعداد شمارهها | 903 |
| تعداد مقالات | 8,081 |
| تعداد مشاهده مقاله | 15,203,453 |
| تعداد دریافت فایل اصل مقاله | 12,847,775 |
Bounds on the signed distance--domination number of graphs | ||
| Iranian Journal of Science | ||
| مقاله 6، دوره 36، Issue 3.1، آذر 2012، صفحه 367-370 اصل مقاله (117.44 K) | ||
| نوع مقاله: Regular Paper | ||
| شناسه دیجیتال (DOI): 10.22099/ijsts.2014.2088 | ||
| نویسندگان | ||
| D. A. Mojdeh* 1؛ B. Samadi2؛ S. M. Hosseini Moghaddam3 | ||
| 1Department of Mathematics, University of Tafresh, Tafresh, Iran | ||
| 2School of Mathematics, Institute for Research in Fundamental Sciences (IPM) Tehran, Iran, P.O. Box 19395-5746 | ||
| 3Shahab Danesh Institute of Higher Education, Qom, Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Signed distance--dominating function؛ th power of a graph | ||
|
آمار تعداد مشاهده مقاله: 1,853 تعداد دریافت فایل اصل مقاله: 1,566 |
||