Results 61 to 70 of about 9,408,041 (287)
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 +24 more
wiley +1 more source
On The Co-Roman Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G = (V, E) be a graph and let f : V (G) → {0, 1, 2} be a function. A vertex v is said to be protected with respect to f, if f(v) > 0 or f(v) = 0 and v is adjacent to a vertex of positive weight. The function f is a co-Roman dominating function if (i)
Shao Zehui +4 more
doaj +1 more source
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 +7 more
wiley +1 more source
Advanced Science, EarlyView.By integrating 516 whole‐genome resequencing datasets and 236 transcriptomes of allotetraploid common carp, this study establishes the first population‐scale atlas of transposable element (TE) variation in teleost species. TE bursts, relaxed purifying selection, and lineage‐specific loss of ancient insertions shape genome evolution and phenotypic ...
Shuimu Hu +11 more
wiley +1 more source
Weak signed Roman k-domination in digraphs [PDF]
Opuscula MathematicaLet \(k\geq 1\) be an integer, and let \(D\) be a finite and simple digraph with vertex set \(V(D)\). A weak signed Roman \(k\)-dominating function (WSRkDF) on a digraph \(D\) is a function \(f \colon V(D)\rightarrow \{-1,1,2\}\) satisfying the condition
Lutz Volkmann
doaj +1 more source
IEEE Access, 2021 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 : V (G) - {0, 1, 2} such that if f (v) = 0 then, the vertex v is adjacent to at least one vertex w with f (w) = 2. The
J. A. Martinez +2 more
doaj +1 more source
Anarchism and non-domination [PDF]
, 2019 In this article we recover the classical anarchist deployment of republican tropes of non-domination, tyranny and slavery, to expose the conservative limits of the contemporary neo-Roman republican revival. For the anarchists, the modern nation state and
WAL Prichard (21872402) +1 more
core +5 more sources
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 +4 more
wiley +1 more source
The study of Roman domination number
, 2015 碩士在一個圖G=(V,E)上， 定義一個函數 f 將V對應到{0, 1, 2}，假如f滿足每一個對應到0 的點都有一個對應到2的鄰居，函數 f 稱為羅馬控制函數。函數f的權重為圖中所有點相應的權重總和，而所有可能的羅馬控制函數中權重最小者稱為圖 G 的羅馬控制數。一個蜘蛛圖 G(k_1,k_2,k_3,…,k_t )為含有共同端點的t個路徑〖 P〗_(k_1 ), 〖 P〗_(k_2 ), …, 〖 P〗_(k_t )所形成的圖。一個一般蜘蛛圖〖 C〗_t (k_1,k_2,k_3,…,k_t ...
許智雄; Xu, Zhi-Xiong
core +1 more source
[k]-Roman Domination in Digraphs
, 2023 Let D=(V(D),A(D)) be a finite, simple digraph and k a positive integer. A function f:V(D)→{0,1,2,…,k+1} is called a [k]-Roman dominating function (for short, [k]-RDF) if f(AN−[v])≥|AN−(v)|+k for any vertex v∈V(D), where AN&
Ruijuan Li, Xinhong Zhang, Xin Song
core +1 more source