آمار
| تعداد نشریات | 50 |
| تعداد شمارهها | 2,172 |
| تعداد مقالات | 20,096 |
| تعداد مشاهده مقاله | 23,681,850 |
| تعداد دریافت فایل اصل مقاله | 21,754,899 |
Semi-Total Domination in Graphs | ||
| Journal of New Researches in Mathematics | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 21 شهریور 1402 | ||
| نوع مقاله: research paper | ||
| شناسه دیجیتال (DOI): 10.30495/jnrm.2023.70523.2347 | ||
| نویسندگان | ||
Gholam Hassan Shirdel   1؛ Mojtaba H Ghanbari 2؛ Mitra Ramezani3
| ||
| 1Associate Professor at University of Qom | ||
| 2Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, IRAN. | ||
| 3Department of Mathematics and Computer Science, University of Qom, Qom, IRAN. | ||
| چکیده | ||
| Abstract: A semi-total Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the following: • Every vertex v for which f(v) = 0 is adjacent to at least one vertex w for which f(w) = 2 • If x is an isolated vertex in the subgraph induced by the set of vertices labeled with 1 and 2, then f(x) = 2. The weight of a semi-total Roman dominating function is the value w(f)=f(V)=∑_(u∈V)▒〖f(u).〗 The minimum weight of a semi-total Roman dominating function on a graph G = (V,E) is called the semi-total Roman domination number of G. We introduce the semi-total Roman domination number of graphs in this article ,and being the study of its combinatorial and computational properties. We find interest results I the end. Keywords: Domination, Domination numbers , Roman Domination number , semi-total Roman dominating number, total Roman domination number | ||
| کلیدواژهها | ||
| Domination؛ Domination numbers؛ Roman Domination number؛ semi-total Roman dominating number؛ total Roman domination number | ||
|
آمار تعداد مشاهده مقاله: 27 |
||
