Results 61 to 70 of about 9,286,296 (115)

Total Weak Roman Domination in Graphs

, 2019
Given a graph G=(V,E) , a function f:V→{0,1,2,⋯} is said to be a total dominating function if ∑u∈N(v)f(u)>0 for every v∈V , where N(v) denotes the open neighbourhood of v. Let Vi={x∈V:f(x)=i} .
Martínez A, Montejano L, Rodríguez-Velázquez J
core   +2 more sources

Roman Domination in Complementary Prism Graphs [PDF]

, 2012
A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x)
Chaitra, V., Chaluvaraju, B.
core  

Bounds on the global double Roman domination number in graphs [PDF]

Let $G$ be a simple graph of order $n$ and let $\gamma_{gdR}(G)$ be the global double Roman domination number of $G$. In this paper, we give some upper bounds on the global double Roman domination number of $G$.
Seyed Mahmoud Sheikholeslami, Chen, Xiaodan, Xiaodan Chen, Sheikholeslami, Seyed Mahmoud, Shouliu Wei, Guoliang Hao, Wei, Shouliu, Hao, Guoliang   +7 more
core   +1 more source

Signed double Roman k-domination in digraphs

Let D be a finite simple digraph with vertex set V(D), and let k≥1 be an integer. A signed double Roman k-dominating function (SDRkDF) on a digraph D is a function f: V(D) → {-1,1,2,3} satisfying certain conditions.
Zverovich, Vadim, Volkmann, Lutz
core  

Signed total double Roman dominating functions in graphs

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
H. Abdollahzadeh Ahangar, L. Shahbazi, S. M. Sheikholeslami   +2 more
core   +1 more source

Primordial black holes and their gravitational-wave signatures. [PDF]

Living Rev Relativ
Bagui E, Clesse S, De Luca V, Ezquiaga JM, Franciolini G, García-Bellido J, Joana C, Kumar Jain R, Kuroyanagi S, Musco I, Papanikolaou T, Raccanelli A, Renaux-Petel S, Riotto A, Ruiz Morales E, Scalisi M, Sergijenko O, Ünal C, Vennin V, Wands D, LISA Cosmology Working Group.   +20 more
europepmc   +1 more source

Total and Double Total Domination on Octagonal Grid

A k-total dominating set is a set of vertices such that all vertices in the graph, including the vertices in the dominating set themselves, have at least k neighbors in the dominating set.
Antoaneta Klobučar, Ana Klobučar Barišić   +1 more
core   +1 more source

Corporate Purpose Swings as a Social, Atheoretical Process: Will the Pendulum Break? [PDF]

Oxf J Leg Stud
Galanis M.
europepmc   +1 more source

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