Results 41 to 50 of about 10,626,776 (155)

[k]-Roman Domination in Digraphs

, 2023
Let D=(V(D),A(D)) be a finite, simple digraph and k a positive integer. A function f:V(D)→{0,1,2,…,k+1} is called a [k]-Roman dominating function (for short, [k]-RDF) if f(AN−[v])≥|AN−(v)|+k for any vertex v∈V(D), where AN&
Ruijuan Li, Xinhong Zhang, Xin Song
core   +1 more source

THE ROMAN BONDAGE NUMBER OF A DIGRAPH

, 2016
Let D=(V,A)D=(V,A) be a finite and simple digraph. A Roman dominating function on DD is a labeling f:V(D)→{0,1,2}f:V(D)→{0,1,2} such that every vertex with label 0 has an in-neighbor with label 2.
Sheikholeslami, Seyed Mahmoud;Dehgardi, Nasrin;Volkmann, Lutz;Meierling, Dirk, Meierling, Dirk, Volkmann, Lutz, Sheikholeslami, Seyyed Mahmoud, Dehgardi, Nasrin   +4 more
core   +1 more source

Domination parameters of generalized Sierpiński graphs

AKCE International Journal of Graphs and Combinatorics
In this paper, we obtain the Italian domination number, perfect Italian domination number and double Roman domination number of generalized Sierpiński graph [Formula: see text] where G is a cycle Cn, [Formula: see text] a complete bipartite graph ...
Jismy Varghese, V. Anu, Lakshmanan S. Aparna   +2 more
doaj   +1 more source

Some Properties of Double Roman Domination

, 2020
A double Roman dominating function on a graph G is a function f:VG⟶0,1,2,3 satisfying the conditions that every vertex u for which fu=0 is adjacent to at least one vertex v for which fv=3 or two vertices v1 and v2 for which fv1=fv2=2 and every vertex u ...
Xiaoqing Zhou, Hong Yang
core   +1 more source

Domination parameters: Roman domination number

, 2022
Tezin 1. bölümünde, baskınlık sayısı ve Roman baskınlık sayısı tanımları verilerek, bu kavramlar günlük yaşamdan örnekler ile açıklanmıştır. Ardından Roman baskınlık sayısı için literatürde yer alan bazı sonuçlar verilmiştir. Tezin 2.
Zaim, Nurdan
core  

The study of Roman domination number

, 2015
碩士在一個圖G=(V,E)上， 定義一個函數 f 將V對應到{0, 1, 2}，假如f滿足每一個對應到0 的點都有一個對應到2的鄰居，函數 f 稱為羅馬控制函數。函數f的權重為圖中所有點相應的權重總和，而所有可能的羅馬控制函數中權重最小者稱為圖 G 的羅馬控制數。一個蜘蛛圖 G(k_1,k_2,k_3,…,k_t )為含有共同端點的t個路徑〖 P〗_(k_1 ), 〖 P〗_(k_2 ), …, 〖 P〗_(k_t )所形成的圖。一個一般蜘蛛圖〖 C〗_t (k_1,k_2,k_3,…,k_t ...
許智雄; Xu, Zhi-Xiong
core   +1 more source

Singed Total Domatic Number of a Graph [PDF]

, 2010
The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol, Walikar, H.B., Kishori P.Narayankar   +2 more
core   +1 more source

Signed total double Roman dominating functions in graphs

AKCE International Journal of Graphs and Combinatorics
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi, H. Abdollahzadeh Ahangar, S. M. Sheikholeslami   +2 more
doaj   +1 more source

The Number of Minimum Dominating Sets in Pn × P2 [PDF]

, 2010
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar, Shirakol, Shailaja S., Shailaja S. Shirakol, H.B.Walikar, Narayankar, Kishori P., H. B. Walikar   +5 more
core   +1 more source

Double domination in lexicographic product graphs [PDF]

, 2020
[EN] In a graph G, a vertex dominates itself and its neighbours. A subset S subset of V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice.
Cabrera Martínez, Abel, Rodríguez Velázquez, Juan Alberto, Rodríguez-Velázquez, J.A., Cabrera García, Suitberto   +3 more
core   +1 more source