Results 51 to 60 of about 9,408,041 (287)

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

Lower and upper bounds on independent double Roman domination in trees

open access: yesElectronic Journal of Graph Theory and Applications, 2022
For a graph G = (V, E), a double Roman dominating function (DRDF) f : V → {0, 1, 2, 3} has the property that for every vertex v ∈ V with f(v)=0, either there exists a neighbor u ∈ N(v), with f(u)=3, or at least two neighbors x, y ∈ N(v) having f(x)=f(y ...
M. Kheibari   +3 more
doaj   +1 more source

Domination parameters: Roman domination number

open access: yes, 2022
Tezin 1. bölümünde, baskınlık sayısı ve Roman baskınlık sayısı tanımları verilerek, bu kavramlar günlük yaşamdan örnekler ile açıklanmıştır. Ardından Roman baskınlık sayısı için literatürde yer alan bazı sonuçlar verilmiştir. Tezin 2.
Zaim, Nurdan
core  

Trees with vertex-edge Roman Domination number twice the domination number minus one

open access: yes, 2020
A vertex-edge Roman dominating function (or just ve-RDF) of a graph G = (V, E) is a function f : V (G) → {0, 1, 2} such that for each edge e = uv either max{f (u), f (v)} ≠ 0 or there exists a vertex w such that either wu ∈ E or wv ∈ E and f (w) = 2. The
Venkatakrishnan, Y. B., Naresh Kumar, H.
core   +1 more source

Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]

open access: yes, 2003
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD   +6 more
core   +1 more source

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

Quasi total double Roman domination in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
S. Kosari   +4 more
doaj   +1 more source

Multiscale Modelling of the Electrocatalysis of Microenzymes: Insights Into the Performance of Microperoxidase at an Aqueous/Graphene Interface and Their Exploitation to Improve Performance

open access: yesAdvanced Science, EarlyView.
A novel multiscale MD/DFT framework to elucidate microenzyme adsorption and electron transfer is reported. This method reveals distinct configurations for microperoxidase‐11 on graphene and those best suited for electron transfer. Rate constants align with the limited experimental data, establishing this framework as a tool for optimizing microenzyme ...
Milan Mijajlovic   +6 more
wiley   +1 more source

On the D-differential of a graph

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj   +1 more source

The double Roman domination number of generalized Sierpiński graphs [PDF]

open access: yesDiscrete Mathematics, Algorithms and Applications, 2020
In this paper, we study the double Roman domination number of generalized Sierpiński graphs [Formula: see text]. More precisely, we obtain a bound for the double Roman domination number of [Formula: see text]. We also find the exact value of [Formula: see text].
Anu V., S. Aparna Lakshmanan
openaire   +3 more sources

Home - About - Disclaimer - Privacy