Results 61 to 70 of about 708,300 (289)
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
Our findings establish SUMOylation as a key post‐translational control layer in auxin signaling. We show that SIZ1‐mediated SUMOylation of LBD29 promotes its association with ARF7, stabilizing a transcriptional hub that governs lateral root development.
Jiaxuan Sui +7 more
wiley +1 more source
Independent Double Roman Domination Stability in Graph
An independent double Roman dominating function (IDRD-function) on a graph $G$ is a function $f :V(G)\to \{0, 1, 2, 3\}$ having the property that (i) if $f(v) = 0$, then the vertex $v$ must have at least two neighbors assigned 2 under $f$ or one neighbor
S. Sheikholeslami +4 more
semanticscholar +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
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
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
Abstract The upper carbonate concretion levels of the Romualdo Formation (Aptian, Brazil) have yielded several theropod dinosaur remains, including spinosaurids and the coelurosaurs Santanaraptor placidus and Mirischia asymmetrica, the phylogenetic affinities of which are controversial.
Rafael Delcourt +4 more
wiley +1 more source
Abstract The cortical bone structure of long bone diaphyses changes throughout growth via skeletal modeling and has important implications for bone strength and structural integrity. Ontogenetic trends in diaphyseal structure have been identified in both chimpanzees and humans but it is not yet clear how these trends compare given notable differences ...
Karen R. Swan +3 more
wiley +1 more source
Powers of Large Matrices on GPU Platforms to Compute the Roman Domination Number of Cylindrical Graphs [PDF]
The Roman domination in a graph $G$ is a variant of the classical domination, defined by means of a so-called Roman domination function $f\colon V(G)\to \{0,1,2\}$ such that if $f(v)=0$ then, the vertex $v$ is adjacent to at least one vertex $w$
J. A. Martínez +2 more
semanticscholar +1 more source

