Results 1 to 10 of about 25,772 (133)
On the Outer-Independent Double Roman Domination of Graphs [PDF]
An outer-independent double Roman dominating function (OIDRDF) of a graph G is a function h:V(G)→{0,1,2,3} such that i) every vertex v with f(v)=0 is adjacent to at least one vertex with label 3 or to at least two vertices with label 2, ii) every vertex ...
Yongsheng Rao +4 more
doaj +4 more sources
On Two Outer Independent Roman Domination Related Parameters in Torus Graphs
In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f is an assignment such that every vertex assigned 0 has at least one neighbor assigned 2 and all vertices labeled by 0 are independent, then f is called an outer independent Roman dominating ...
Hong Gao +3 more
doaj +4 more sources
On the Outer Independent Double Roman Domination Number [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh +3 more
exaly +5 more sources
On the Outer Independent Total Double Roman Domination in Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, H. +3 more
openaire +5 more sources
Abstract This narrative review summarizes the collective knowledge on periodontal microbiology, through a historical timeline that highlights the European contribution in the global field. The etiological concepts on periodontal disease culminate to the ecological plaque hypothesis and its dysbiosis‐centered interpretation.
Georgios N. Belibasakis +5 more
wiley +1 more source
Domination parameters with number 2: Interrelations and algorithmic consequences [PDF]
In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak 2-domination ...
Bonomo, Flavia +4 more
core +2 more sources
Roman Domination in Complementary Prism Graphs [PDF]
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 +2 more sources
Primordial Gravitational Waves From Open Inflation [PDF]
We calculate the spectrum of gravitational waves generated during inflation in open $(\Omega ...
A. Linde +45 more
core +4 more sources
Glorified Fantasies and Masterpieces of Deception on Importing L as V egas into the ‘New S outh A frica’ [PDF]
With the end of apartheid, J ohannesburg and other S outh A frican cities are now part of a new global race to become ‘world‐class’ tourist and business centers.
Fu, Albert S., Murray, Martin J.
core +1 more source
Alirans and the Fall of the Old Order [PDF]
Page range: 23 ...
Hindley, Donald
core +1 more source

