آمار
| تعداد نشریات | 7 |
| تعداد شمارهها | 77 |
| تعداد مقالات | 707 |
| تعداد مشاهده مقاله | 681,151 |
| تعداد دریافت فایل اصل مقاله | 493,165 |
Outer independent Roman domination number of trees | ||
| Communications in Combinatorics and Optimization | ||
| دوره 6، شماره 2، پاییز و زمستان 2021، صفحه 273-286 اصل مقاله (376.61 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2021.27072.1191 | ||
| نویسندگان | ||
Nasrin Dehgardi  1؛ M Chellali2
| ||
| 1Sirjan University of Technology, Sirjan 78137, Iran | ||
| 2LAMDA-RO Laboratory, Department of Mathematics University of Blida B.P. 270, Blida, Algeria | ||
| چکیده | ||
| A Roman dominating function (RDF) on a graph $G=(V,E)$ is a function $% f:V\rightarrow \{0,1,2\}$ such that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. An RDF $f$ is called an outer independent Roman dominating function (OIRDF) if the set of vertices assigned a $0$ under $f$ is an independent set. The weight of an OIRDF is the sum of its function values over all vertices, and the outer independent Roman domination number $\gamma _{oiR}(G)$ is the minimum weight of an OIRDF on $G$. In this paper, we show that if $T$ is a tree of order $% n\geq 3$ with $s(T)$ support vertices, then $\gamma _{oiR}(T)\leq \min \{\frac{5n}{6},\frac{3n+s(T)}{4}\}.$ Moreover, we characterize the tress attaining each bound. | ||
| کلیدواژهها | ||
| Outer independent Roman dominating function؛ outer independent Roman domination number؛ tree | ||
|
آمار تعداد مشاهده مقاله: 140 تعداد دریافت فایل اصل مقاله: 153 |
||
