- Tytuł:
- Total Roman {2}-Dominating Functions in Graphs
- Autorzy:
-
Ahangar, H. Abdollahzadeh
Chellali, M.
Sheikholeslami, S.M.
Valenzuela-Tripodoro, J.C. - Powiązania:
- https://bibliotekanauki.pl/articles/32304142.pdf
- Data publikacji:
- 2022-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Roman domination
Roman {2}-domination
total Roman {2}-domination - Opis:
- A Roman {2}-dominating function (R2F) is a function f : V → {0, 1, 2} with the property that for every vertex v ∈ V with f(v) = 0 there is a neighbor u of v with f(u) = 2, or there are two neighbors x, y of v with f(x) = f(y) = 1. A total Roman {2}-dominating function (TR2DF) is an R2F f such that the set of vertices with f(v) > 0 induce a subgraph with no isolated vertices. The weight of a TR2DF is the sum of its function values over all vertices, and the minimum weight of a TR2DF of G is the total Roman {2}-domination number γtR2(G). In this paper, we initiate the study of total Roman {2}-dominating functions, where properties are established. Moreover, we present various bounds on the total Roman {2}-domination number. We also show that the decision problem associated with γtR2(G) is possible to compute this parameter in linear time for bounded clique-width graphs (including trees).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2022, 42, 3; 937-958
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł