Results 11 to 20 of about 135,416 (202)

Anarchism and non-domination [PDF]

, 2019
In this article we recover the classical anarchist deployment of republican tropes of non-domination, tyranny and slavery, to expose the conservative limits of the contemporary neo-Roman republican revival. For the anarchists, the modern nation state and
WAL Prichard (21872402), R Kinna (7439780)   +1 more
core   +16 more sources

Upper paired domination versus upper domination [PDF]

Discrete Mathematics & Theoretical Computer Science, 2021
A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by $\Gamma(G ...
Hadi Alizadeh, Didem Gözüpek
doaj   +1 more source

Some Results on the Strong Roman Domination Number of Graphs [PDF]

Mathematics Interdisciplinary Research, 2020
Let G=(V,E) be a finite and simple graph of order n and maximum‎ ‎degree Δ(G)‎. ‎A strong Roman dominating function on a‎ ‎graph  G  is a function  f‎:V (G)→{0‎, ‎1,… ,‎[Δ(G)/2 ]‎+ ‎1}  satisfying the condition that every‎ ‎vertex v for which  f(v)=0  is
Akram Mahmoodi, Sakineh Nazari-Moghaddam, Afshin Behmaram   +2 more
doaj   +1 more source

Degree equitable restrained double domination in graphs

Electronic Journal of Graph Theory and Applications, 2021
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D has a neighbor u ∈ D such that |dG(u)-dG(v)| ≤ 1. An equitable dominating set D is a degree equitable restrained double dominating set (DERD-dominating set)
Sunilkumar M Hosamani, Shailaja Shirkol, Preeti B. Jinagouda, Marcin Krzywkowski   +3 more
doaj   +1 more source

$k$-Efficient partitions of graphs [PDF]

Communications in Combinatorics and Optimization, 2019
A set $S = \{u_1,u_2, \ldots, u_t\}$ of vertices of $G$ is an efficient dominating set if every vertex of $G$ is dominated exactly once by the vertices of $S$.
M. Chellali, Teresa W. Haynes, Stephen T. Hedetniemi   +2 more
doaj   +1 more source

Relatively Prime Inverse Domination On Line Graph

Ratio Mathematica, 2023
Let G be non-trivial graph. A subset D of the vertex set V (G) of a graph G is called a dominating set of G if every vertex in V − D is adjacent to a vertex in D.
C. Jayasekaran, Roshini L
doaj   +1 more source

Further Results on the Total Roman Domination in Graphs

Mathematics, 2020
Let G be a graph without isolated vertices. A function f : V ( G ) → { 0 , 1 , 2 } is a total Roman dominating function on G if every vertex v ∈ V ( G ) for which f ( v ) = 0 is adjacent to at least one vertex u ...
Abel Cabrera Martínez, Suitberto Cabrera García, Andrés Carrión García   +2 more
doaj   +1 more source

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +1 more source

Perfect Domination Excellent Trees [PDF]

, 2012
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core   +1 more source

EQUITABLE RINGS DOMINATION IN GRAPHS [PDF]

Journal of Algebraic Systems
A dominating set $S$ of $G$ is an \textit{equitable dominating set} of $G$ if for every $v \in V(G) \setminus S$, there exists $u \in S$ such that $uv \in V(G)$ and $\displaystyle{\left|\deg(u) - \deg(v)\right| \leq 1.}$ A dominating set $S$ of $G$ is a \
Mark Caay
doaj   +1 more source