Results 311 to 320 of about 776,655 (324)

Relations between the Roman k-domination and Roman domination numbers in graphs

Discrete Mathematics, Algorithms and Applications, 2014
Let G = (V, E) be a graph and let k be a positive integer. A Roman k-dominating function ( R k-DF) on G is a function f : V(G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least k vertices v1, v2, …, vk with f(vi) = 2 for i = 1, 2, …, k.
Ahmed Bouchou, Mustapha Chellali, Mostafa Blidia   +2 more
openaire   +2 more sources

Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm

Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Let G=(V, E) be a graph. A function f: V→\{0,1,2\}, if ∀u for which f(u)=0 is adjacent to ∃v for which f(v)=2, is called a Roman dominating function, and called in short terms RDF. The weight of an RDF f is f(V)=∑\_(v∈V)f(v).
Derya Dogan Durgun, Emre Niyazi Toprakkaya   +1 more
semanticscholar   +1 more source

Roman Domination and Double Roman Domination Numbers of Sierpiński Graphs $$S(K_n,t)$$

Bulletin of the Malaysian Mathematical Sciences Society, 2021
Different types of domination on the Sierpinski graphs $$S(K_n,t)$$ will be studied in this paper. More precisely, we propose a minimal dominating set for each $$S(K_n,t)$$
openaire   +2 more sources

Roman Jakobson: ‘The Dominant’

1997
The first three stages of Formalist research have been briefly characterized as follows: (1) analysis of the sound aspects of a literary work; (2) problems of meaning within the framework of poetics; (3) integration of sound and meaning into an inseparable whole.
openaire   +2 more sources

Signed Roman domination in digraphs

Journal of Combinatorial Optimization, 2013
Let $$D$$D be a finite and simple digraph with vertex set $$V(D)$$V(D) and arc set $$A(D)$$A(D). A signed Roman dominating function (SRDF) on the digraph $$D$$D is a function $$f:V(D)\rightarrow \{-1,1,2\}$$f:V(D)?{-1,1,2} satisfying the conditions that (i) $$\sum _{x\in N^-[v]}f(x)\ge 1$$?x?N-[v]f(x)?1 for each $$v\in V(D)$$v?V(D), where $$N^-[v]$$N ...
Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +1 more
openaire   +2 more sources

Unique Response Roman Domination: Complexity and Algorithms

Algorithmica, 2023
Sumanta Banerjee, Juhi Chaudhary, D. Pradhan   +2 more
semanticscholar   +1 more source

Maximal double Roman domination in graphs

Applied Mathematics and Computation, 2022
H. Ahangar, M. Chellali, S. Sheikholeslami, Juan Carlos Valenzuela Tripodoro   +3 more
semanticscholar   +1 more source

Roman domination matrix

2nd INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCES-MODELLING, COMPUTING AND SOFT COMPUTING (CSMCS 2022), 2023
M. Shikhi
semanticscholar   +1 more source

Computing Strong Roman Domination of Trees and Unicyclic Graphs in Linear Time

Bulletin of the Malaysian Mathematical Sciences Society, 2022
A. Poureidi, Noor A'lawiah Abd Aziz, N. J. Rad, H. Kamarulhaili   +3 more
semanticscholar   +1 more source

Roman domination and independent Roman domination on graphs with maximum degree three

Discrete Applied Mathematics
A. Luiz
semanticscholar   +1 more source