Results 61 to 70 of about 1,605,758 (310)
Outer independent double Roman domination in unicyclic and bicyclic graphs
An outer independent double Roman dominating function (OIDRDF) of a graph \( G \) is a function \( f:V(G)\rightarrow\{0,1,2,3\} \) satisfying the following conditions: (i) every vertex \( v \) with \( f(v)=0 \) is adjacent to a vertex assigned 3 or at ...
S. Nazari-Moghaddam +2 more
semanticscholar +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
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
Replacing toxic NiOx with phenyl‐substituted phosphonic‐acid carbazole monolayers (Ph‐5PACz) yields inverted perovskite solar cells that are efficient and recyclable. The nickel‐free interface reaches 25.3% efficiency and enables closed‐loop ITO recovery with near‐98% performance retention, while life‐cycle and techno‐economic analyses confirm lower ...
Yanxue Wang +17 more
wiley +1 more source
Notes on double Roman domination edge critical graphs
Given a graph G=(V,E), a double Roman dominating function (DRDF) on a graph G is a function f:V→{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=3 or two vertices v₁ and v₂ for ...
A. Omar, A. Bouchou
semanticscholar +1 more source
On trees with equal Roman domination and outer-independent Roman domination numbers
Summary: A Roman dominating function (RDF) on a graph \(G\) is a function \(f : V (G) \to \{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\). A Roman dominating function \(f\) is called an outer-independent Roman dominating function (OIRDF) on \(G\) if ...
Sheikholeslami, Seyed Mahmoud +1 more
openaire +2 more sources
The hydration behavior of C3S in seawater‐relevant solutions is studied based on experiments, boundary nucleation and growth (BNG) modeling, and machine learning. The main ions included in seawater modify hydration mechanisms, with MgCl2 showing the strongest acceleration effect at the same concentration.
Yanjie Sun +6 more
wiley +1 more source
Hop total Roman domination in graphs
In this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 there exists ...
H. Abdollahzadeh Ahangar +3 more
doaj +1 more source
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

