Results 11 to 20 of about 623,562 (309)
Bulletin of the London Mathematical Society, 2019 Let M be a compact oriented even-dimensional manifold. This note constructs a compact symplectic manifold S of the same dimension and a map f from S to M of strictly positive degree.
Fine, Joel, Panov, Dmitri
core +3 more sources
Domination versus edge domination [PDF]
Discrete Applied Mathematics, 2020 We propose the conjecture that the domination number $ (G)$ of a $ $-regular graph $G$ with $ \geq 1$ is always at most its edge domination number $ _e(G)$, which coincides with the domination number of its line graph. We prove that $ (G)\leq \left(1+\frac{2( -1)}{ 2^ }\right) _e(G)$ for general $ \geq 1$, and $ (G)\leq \left(\frac{7}{6 ...
Baste, Julien +4 more
openaire +3 more sources
DOMINATION AND EDGE DOMINATION IN TREES [PDF]
Ural Mathematical Journal, 2020 Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V \setminus S\) is adjacent to a vertex in \(S\). The domination number of a graph \(G\), denoted by \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). A set \(D \subseteq E\) is an edge dominating set if every edge in \(E\setminus D\)
B. Senthilkumar +2 more
openaire +3 more sources
On the {2}-domination number of graphs
AIMS Mathematics, 2022 Let $ G $ be a nontrivial graph and $ k\geq 1 $ an integer. Given a vector of nonnegative integers $ w = (w_0, \ldots, w_k) $, a function $ f: V(G)\rightarrow \{0, \ldots, k\} $ is a $ w $-dominating function on $ G $ if $ f(N(v))\geq w_i $ for every $ v\
Abel Cabrera-Martínez +1 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 +3 more
doaj +1 more source
HTS Teologiese Studies/Theological Studies, 2022 Violence has become a common phenomenon that affects women and children, particularly during the coronavirus disease 2019 (COVID-19) pandemic. While the lockdown regulations were meant to save lives by preventing further spread of the virus, another ...
Tshenolo J. Madigele, Gift T. Baloyi
doaj +1 more source
The case for epistocratic republicanism [PDF]
, 2020 In recent years, the fortunes of democracy have waned both in theory and practice. This has added impetus not only to the republican case for strengthening democratic institutions but also to new anti-democratic thought.
Blunt, G. D.
core +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 +2 more
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 Imagine that we are given a set $D$ of officials and a set $W$ of civils. For each civil $x \in W$, there must be an official $v \in D$ that can serve $x$, and whenever any such $v$ is serving $x$, there must also be another civil $w \in W$ that observes $v$, that is, $w$ may act as a kind of witness, to avoid any abuse from $v$.
Magda Dettlaff +4 more
openaire +3 more sources
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 +2 more
doaj +1 more source