Results 51 to 60 of about 776,655 (324)
Theoretical studies of the
Maǧallaẗ Al-Kuwayt li-l-ʿulūmBojan Nikolić +3 more
openalex +2 more sources
What Has Athens to Do with Rome? Tocqueville and the New Republicanism [PDF]
, 2017 The recent debate over “republican” conceptions of freedom as non-domination has re- invigorated philosophical discussions of freedom. However, “neo-Roman” republicanism, which has been characterized as republicanism that respects equality, has largely ...
Jech, Alexander
core +1 more source
Total Perfect Roman Domination
Symmetry, 2023 A total perfect Roman dominating function (TPRDF) on a graph G=(V,E) is a function f from V to {0,1,2} satisfying (i) every vertex v with f(v)=0 is a neighbor of exactly one vertex u with f(u)=2; in addition, (ii) the subgraph of G that is induced by the
Ahlam Almulhim
semanticscholar +1 more source
Critical graphs with Roman domination number four
AKCE International Journal of Graphs and Combinatorics, 2020 A Roman domination function on a graph G is a function satisfying the condition that every vertex u for which r(u) = 0 is adjacent to at least one vertex v for which r(v) = 2.
A. Martínez-Pérez, D. Oliveros
doaj +1 more source
AIMS Mathematics, 2023 Let $ G = (V, E) $ be a simple graph with vertex set $ V $ and edge set $ E $, and let $ f $ be a function $ f:V\mapsto \{0, 1, 2\} $. A vertex $ u $ with $ f(u) = 0 $ is said to be undefended with respect to $ f $ if it is not adjacent to a vertex with ...
Jian Yang, Yuefen Chen, Zhiqiang Li
semanticscholar +1 more source
Discrete Applied Mathematics, 2016 For a graph G = ( V , E ) , a double Roman dominating function is a function f : V ź { 0 , 1 , 2 , 3 } having the property that if f ( v ) = 0 , then vertex v must have at least two neighbors assigned 2 under f or one neighbor with f ( w ) = 3 , and if f ( v ) = 1 , then vertex v must have at least one neighbor with f ( w ) ź 2 . The weight of a double
Beeler, Robert A. +2 more
openaire +3 more sources
Total Roman domination on the digraphs
Open Mathematics, 2023 Let D = ( V , A ) D=\left(V,A) be a simple digraph with vertex set V V , arc set A A , and no isolated vertex. A total Roman dominating function (TRDF) of D D is a function h : V → { 0 , 1 , 2 } h:V\to \left\{0,1,2\right\} , which satisfies that each ...
Xinhong Zhang, Xin Song, Ruijuan Li
semanticscholar +1 more source
On the (total) Roman domination in Latin square graphs
AIMS Mathematics, 2023 Latin square, also known as Latin square matrix, refers to a kind of $ n\times n $ matrix, in which there are exactly $ n $ different symbols and each symbol appears exactly once in each row and column.
Chang-Xu Zhang +2 more
semanticscholar +1 more source
Total Roman domination subdivision number in graphs [PDF]
Communications in Combinatorics and Optimization, 2020 A {\em Roman dominating function} on a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$.
Jafar Amjad
doaj +1 more source
[k]-Roman Domination in Digraphs
Symmetry, 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−(v)={u∈N−(v):f(u)≥1} and AN−[v]=
Xinhong Zhang, Xin Song, Ruijuan Li
semanticscholar +1 more source