Results 41 to 50 of about 1,131,018 (144)
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
Perfect domination, Roman domination and perfect Roman domination in lexicographic product graphs
The aim of this paper is to obtain closed formulas for the perfect dominationnumber, the Roman domination number and the perfect Roman domination number oflexicographic product graphs.
Garcia-Gomez, C. +5 more
core +1 more source
Confucian Role-Ethics with Non-Domination: Civil Compliance in Times of Crisis. [PDF]
Kwak JH.
europepmc +1 more source
The signed total Roman domatic number of a digraph
Let [Formula: see text] be a finite simple digraph with vertex set [Formula: see text]. A signed total Roman dominating function (STRDF) on a digraph [Formula: see text] is a function [Formula: see text] such that (i) [Formula: see text] for every ...
J. Amjadi
core +1 more source
Domination in graphs with few edges [PDF]
summary:The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the signed domination number $\g_s (G)$ and the minus domination number $\g^-(G)$. These numerical invariants are compared for graphs in which the degrees of
Zelinka, Bohdan
core +1 more source
Towards a new model of global health justice: the case of COVID-19 vaccines. [PDF]
Jecker NS, Atuire CA, Bull SJ.
europepmc +1 more source
A socio-legal imperative of domestic violence prohibition in Africa vis-a-vis Nigerian legal structure for sexually abused women. [PDF]
Aina-Pelemo AD, Olujobi OJ, Yebisi ET.
europepmc +1 more source
Exploring the ethics of political PR professionals using moral foundations theory. [PDF]
Mikhaylova O, Abramov R.
europepmc +1 more source
For a graph (Formula presented.), a Roman dominating function (Formula presented.) has the property that every vertex (Formula presented.) with (Formula presented.) has a neighbor (Formula presented.) with (Formula presented.).
Haynes, Teresa W. +4 more
core +1 more source
Roman Domination Cover Rubbling [PDF]
In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of ...
Carney, Nicholas
core +1 more source

