Results 51 to 60 of about 14,901,088 (199)

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

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

Advanced 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, Cheng Hu, Yuhui Sun, Matthew J. Penna, Meisam V. Kiamahalleh, Wenrong Yang, Mark J. Biggs   +6 more
wiley   +1 more source

Domination parameters: Roman domination number

, 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  

A note on the double Roman domination number of graphs [PDF]

, 2020
summary:For a graph $G=(V,E)$, a double Roman dominating function is a function $f\colon V\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least two neighbors assigned $2$ under $f$ or one neighbor with $f(w)
Chen, Xue-Gang
core   +1 more source

On upper bounds for total $k$-domination number via the probabilistic method [PDF]

, 2023
summary:For a fixed positive integer $k$ and $G=(V, E)$ a connected graph of order $n$, whose minimum vertex degree is at least $k$, a set $S\subseteq V$ is a total $k$-dominating set, also known as a $k$-tuple total dominating set, if every vertex $v\in
Cruz-Suárez, Hugo, Sigarreta, Saylé, Sigarreta, Saylí   +2 more
core   +1 more source

Wafer‐Scale Atomically‐Thin Gold: Transferable Platform for Flexible Optoelectronics, Thermal Management and Bio‐Interfaces

Advanced Science, EarlyView.
Combining template stripping with a graphene‐inspired transfer yields continuous, transferable gold films at 6‐inch wafer scale with thicknesses approaching the atomic limit. The atomically smooth, near‐bulk‐quality films offer above 86% transmittance and sub‐20 Ω/square sheet resistance, serving as a universal platform for flexible optoelectronics ...
Dmitry Yakubovsky, Mikhail Mironov, Georgy Ermolaev, Aleksandr Khrebtov, Aleksandr Slavich, Prashant Narute, Pritom Chowdhury, Roman Kirtaev, Igor Khramtsov, Anton Minnekhanov, Gleb Tselikov, Dmitriy Grudinin, Maria Sidorova, Nikolay Pak, Pavel Maslov, Andrey Vyshnevyy, Hongkai Zhou, Vasyl G. Kravets, Alexander N. Grigorenko, Ivan Kruglov, Nikita Orekhov, Dmitry Kireev, Aleksey Arsenin, Kostya S. Novoselov, Valentyn Volkov   +24 more
wiley   +1 more source

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

Advanced 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, Qianlan Yin, Yiying Chen, Liping Zhang, Xiuyuan Yu, Qianqian Yu, Zhaojun Ding, Xiangpei Kong   +7 more
wiley   +1 more source

Upper bounds for domination related parameters in graphs on surfaces

AKCE International Journal of Graphs and Combinatorics, 2016
In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic.
Vladimir Samodivkin
doaj   +1 more source

Roman and Total Domination

, 2015
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination numberγt(G). A Roman dominating function on a graph G is a function
Haynes, Teresa W., Chellali, Mustapha, Hedetniemi, Stephen T.   +2 more
core   +1 more source

Quasi-total Roman Domination in Graphs [PDF]

, 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, Cabrera Martínez, Abel, Yero, Ismael G., Cabrera García, Suitberto   +3 more
core   +1 more source