Results 51 to 60 of about 2,319,231 (271)
Restrained condition on double Roman dominating functions
We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double Roman dominating function (RDRD function) if the subgraph induced by $\{v\in V(G)\mid f(v)=0\}$ has no isolated vertices. The restrained double Roman domination number (RDRD
Babak Samadi +6 more
openaire +4 more sources
Further Results on the [k]-Roman Domination in Graphs [PDF]
In 2016, Beeler et al. defined the double Roman domination as a variation of Roman domination. Sometime later, in 2021, Ahangar et al. introduced the concept of [k]- Roman domination in graphs and settled some results on the triple Roman domination ...
Álvarez Ruiz, María del Pilar +3 more
core +2 more sources
Meta-Heuristic Algorithms for Quasi Total Double Roman Domination Problem
Ensuring the resilience and security of complex networks, such as communication or power grids, requires strategies that can withstand failures and attacks. One such approach involves the use of domination models in graph theory.
Charan Karnati +2 more
semanticscholar +1 more source
By integrating 516 whole‐genome resequencing datasets and 236 transcriptomes of allotetraploid common carp, this study establishes the first population‐scale atlas of transposable element (TE) variation in teleost species. TE bursts, relaxed purifying selection, and lineage‐specific loss of ancient insertions shape genome evolution and phenotypic ...
Shuimu Hu +11 more
wiley +1 more source
This work presents a clinically deployable simultaneous PET/MRI workflow which integrates hyperpolarized 13C imaging of metabolism and extracellular pH with [18F]FMISO PET to characterize hypoxia, acidosis, and metabolic reprogramming in feline sarcoma.
Martin Grashei +17 more
wiley +1 more source
Signed total double Roman dominating functions in graphs
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +1 more source
The Double Roman Domatic Number of a Digraph
A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +1 more source
Brain Network Dynamics of Local and Global Predictive Processing in Aging
Separation of concurrent whole‐brain networks in source‐reconstructed magnetoencephalography (MEG) data suggests that healthy aging reorganizes, rather than uniformly attenuates, neural responses elicited from hierarchical auditory violations. Enhanced early sensory deviance processing alongside reduced higher‐order cognitive responses suggests a large‐
Mathias Houe Andersen +9 more
wiley +1 more source
In dynamic driving scenarios, the proposed approach ensures only temporally aligned sensor inputs to make driving decisions, preventing false activations. By enabling selective hardware‐level learning, it achieves fast, reliable responses under noisy conditions.
Kapil Bhardwaj +4 more
wiley +1 more source
Further Results on Generous Roman Domination [PDF]
Let G=(V(G),E(G)) be a graph and h be a function defined from V(G) to {0,1,2,3}. A vertex x with h(x)=0 is said to be undefended with respect to $h$ if it has no neighbor assigned 2 or 3 under h.
Seyed Mahmoud Sheikholeslami +2 more
doaj +1 more source

