Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
496 15 |
Ultima descărcare din IBN: 2023-12-20 01:31 |
Căutarea după subiecte similare conform CZU |
519.68 (5) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
SM ISO690:2012 KHOEILAR, Rana, KHEIBARI, Mahla, SHAO, Zehui, SHEIKHOLESLAMI, Seyed Mahmoud. Total k-rainbow domination subdivision number in graphs. In: Computer Science Journal of Moldova, 2020, nr. 2(83), pp. 152-169. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 2(83) / 2020 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.68 | ||||||
MSC 2010: 05C69. | ||||||
Pag. 152-169 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
A total k-rainbow dominating function (TkRDF) of G is a function f from the vertex set V (G) to the set of all subsets of the set {1, . . . , k} such that (i) for any vertex v ∈ V (G) with f(v) = ∅ the condition Su2N(v) f(u) = {1, . . . , k} is fulfilled, where N(v) is the open neighborhood of v, and (ii) the subgraph of G induced by {v ∈ V (G) | f(v) 6= ∅} has no isolated vertex. The total k-rainbow domination number, trk(G), is the minimum weight of a TkRDF on G. The total k-rainbow domination subdivision number sd trk (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total k-rainbow domination number. In this paper, we initiate the study of total k-rainbow domination subdivision number in graphs and we present sharp bounds for sd trk (G). In addition, we determine the total 2-rainbow domination subdivision number of complete bipartite graphs and show that the total 2-rainbow domination subdivision number can be arbitrary large. |
||||||
Cuvinte-cheie total k-rainbow domination, total k-rainbow domination subdivision number, k-rainbow domination. |
||||||
|