Results 21 to 30 of about 8,636,707 (226)

Quasi-total Roman Domination in Graphs [PDF]

open access: yes, 2019
[EN] A quasi-total Roman dominating function on a graph G=(V,E) is a function f:V ->{0,1,2}satisfying the following: Every vertex for which u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2, and If x is an isolated vertex in ...
González Yero, Ismael   +3 more
core   +1 more source

Total roman domination in digraphs

open access: yes, 2021
Let D be a nite and simple digraph with vertex set V (D). A Roman dominating function (RDF) on a digraph D is a function f : V (D) → {0; 1; 2} satisfying the condition that every vertex v with f(v) = 0 has an in-neighbor u with f(u) = 2. The weight of an
Zhuang, Wei, Hu, Kangxiu, Hao, Guoliang
core  

Perfect Domination Excellent Trees [PDF]

open access: yes, 2012
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core   +1 more source

Halogen Surface Terminations in Ti3C2 MXenes for Interface Engineering in Perovskite Solar Cells

open access: yesAdvanced Materials Interfaces, EarlyView.
Controlled halogen surface terminations in Ti3C2${\rm Ti}_3{\rm C}_2$ MXenes enable the isolation of structure‐property relationships, revealing how –Cl and –Br terminations influence interlayer spacing, electronic behavior, and work function. When incorporated into IT‐4F‐based interfacial layers, these MXenes modulate interfacial processes and device ...
Morgana Müller de França   +10 more
wiley   +1 more source

Signed double Roman domination on cubic graphs [PDF]

open access: yes, 2023
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized.
Iurlano, Enrico   +3 more
core   +3 more sources

Smart Antibacterial Coatings: Harnessing Bacterial Redox Activity for Infection Control

open access: yesAdvanced Materials Interfaces, EarlyView.
In this study, we have shown that ceftazidime‐loaded poly(3,4‐ethylenedioxythiophene) (PEDOT@CAZ) functions as a smart, redox‐responsive antibacterial coating that couples bacterial electrical activity with localized antibiotic delivery. Shewanella oneidensis and Pseudomonas aeruginosa induced distinct redox responses in PEDOT, reflecting their ...
Abdullah   +8 more
wiley   +1 more source

Total Roman Domination of Kneser Graphs

open access: yes, 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   +6 more
core   +1 more source

SIZ1‐Mediated SUMOylation of LBD29 Recruits ARF7 to Fine‐Tune Auxin Signaling in Lateral Root Development

open access: yesAdvanced Science, EarlyView.
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

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

open access: yesAdvanced 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   +4 more
wiley   +1 more source

Hop total Roman domination in graphs

open access: yes, 2023
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 ...
M. Soroudi   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy