Results 61 to 70 of about 838 (256)

Total Roman Domination of Kneser Graphs

, 2023
The total Roman domination number of a graph is the smallest possible sum of the weights 0, 1, and 2 applied to vertices of the graph that satisfy certain rules originating from Roman military strategy.
Stainsby, Cole, Whitlatch, Hays, Dojan, Grace, Nored, Benjamin, Ikard, Kathryn, Shultis, Katharine, Asplund-Wain, Isabella   +6 more
core  

Experimental Demonstration of Temporally Aware Fault‐Tolerant Sensor Fusion Using Memristive Associative Learning

Advanced Electronic Materials, EarlyView.
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, Ashfak Nehal, Dmitrii Semenov, Roman Sotner, Sayani Majumdar   +4 more
wiley   +1 more source

Defining Frailty in Chinese‐Language Biomedical Literature (2014–2024): A Decade of Conceptual Evolution

AGING MEDICINE, EarlyView.
Frailty definitions in Chinese‐language biomedical literature increasingly align with international frameworks, while retaining conceptual diversity, underscoring the need for multidimensional, cross‐cultural research and integration with traditional Chinese medicine for culturally sensitive clinical practice.
Haodong Wei, David Mockler, Giulia Cavrini, Nathan W. Hill, Daniel Kam Yin Chan, Román Romero Ortuño   +5 more
wiley   +1 more source

Algorithm aspect on total Roman $\{2\}$-domination number of Cartesian products of paths and cycles

, 2023
A total Roman {2}-dominating function (TR2DF) on a graph G with vertex set V is a function f : V → {0, 1, 2} having the property that for every vertex v with f(v) = 0, ∑u∈N (v) f(u) ≥ 2, where N(v) represents the open neighborhood of v, and the subgraph ...
Qin Chen
core   +1 more source

Advanced Experiment Design Strategies for Drug Development

Advanced Intelligent Discovery, EarlyView.
Wang et al. analyze 592 drug development studies published between 2020 and 2024 that applied design of experiments methodologies. The review surveys both classical and emerging approaches—including Bayesian optimization and active learning—and identifies a critical gap between advanced experimental strategies and their practical adoption in ...
Fanjin Wang, Anthony Harker, Mohan Edirisinghe, Maryam Parhizkar   +3 more
wiley   +1 more source

Hydration Behavior of Tricalcium Silicate in Seawater Relevant Salt Systems: A Hybrid Study with the Aid of Machine Learning

Advanced Intelligent Discovery, EarlyView.
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, Chen Zhang, Ting Zhang, Mengze Hong, Peiliang Shen, Chi Sun Poon, Gang Li   +6 more
wiley   +1 more source

Nonnegative signed total Roman domination in graphs

Communications in Combinatorics and Optimization, 2020
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N(v)}f(x)\ge 0$ for
Nasrin Dehgardi, Lutz Volkmann
doaj   +1 more source

Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees

IEEE Access, 2018
An outer-independent total dominating set (OITDS) of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V (G) \ D is independent.
Zepeng Li, Zehui Shao, Fangnian Lang, Xiaosong Zhang, Jia-Bao Liu   +4 more
doaj   +1 more source

On the domination of triangulated discs [PDF]

, 2023
summary:Let $G$ be a $3$-connected triangulated disc of order $n$ with the boundary cycle $C$ of the outer face of $G$. Tokunaga (2013) conjectured that $G$ has a dominating set of cardinality at most $\frac 14(n+2)$.
Abd Aziz, Noor A'lawiah, Kamarulhaili, Hailiza, Jafari Rad, Nader   +2 more
core   +1 more source

Improved Total Domination and Total Roman Domination in Unit Disk Graphs

CoRR
Let $G=(V, E)$ be a simple undirected graph with no isolated vertex. A set $D_t\subseteq V$ is a total dominating set of $G$ if $(i)$ $D_t$ is a dominating set, and $(ii)$ the set $D_t$ induces a subgraph with no isolated vertex. The total dominating set of minimum cardinality is called the minimum total dominating set, and the size of the minimum ...
Sasmita Rout, Gautam Kumar Das
openaire   +2 more sources