Results 41 to 50 of about 9,286,296 (115)
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. +2 more
core +1 more source
Double Roman domination and domatic numbers of graphs [PDF]
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in \cite{bhh} as a function $f:V(G)\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 ...
L. Volkmann
core +1 more source
Utopia Remembers: The Soviet Past in the Imagined Communist Future
Abstract After a twenty‐five‐year hiatus, the reappearance of utopian literature in 1957 prompted Soviet literary watchdogs to corral the subgenre into an ideologically‐acceptable mold. A key requirement was for future generations to be depicted as reverently commemorating the past.
Antony Kalashnikov
wiley +1 more source
This work investigates the heterogeneous nucleation of CsPbBr3${\rm CsPbBr}_3$ nanocrystal superlattices along the faces of 2D PEA2PbBr4${\rm PEA}_2{\rm PbBr}_4$ layered perovskite microcrystals. Core–crown and core–shell heterostructure morphologies are obtained.
Umberto Filippi +6 more
wiley +1 more source
Liquid conductivity governs discharge regime selection. A liquid–gas–liquid discharge system reveals two distinct regimes under identical pulsed excitation. High‐conductivity liquids support a spark‐to‐DC‐glow transition with strong heating and chemical production, whereas low‐conductivity configurations exhibit dielectric‐barrier‐discharge‐like ...
Ayano Goto +4 more
wiley +1 more source
Global total Roman domination in graphs
A total Roman dominating function (TRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions (i) every vertex [Formula: see text] for which [Formula: see text] is adjacent at least one vertex [Formula: see text ...
J. Amjadi +2 more
core +1 more source
Total Roman {3}-domination in Graphs
For a graph G = ( V , E ) with vertex set V = V ( G ) and edge set E = E ( G ) , a Roman { 3 } -dominating function (R { 3 } -DF) is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that
Doost Ali Mojdeh +2 more
core +1 more source
ABSTRACT Computational thinking (CT) has received considerable attention as a key competency in education, yet effective approaches for developing CT remain limited. This quasi‐experimental study included 63 undergraduates to examine the effects of flowchart‐supported learning on CT.
Wei Tang +2 more
wiley +1 more source
Signed Total Roman Domination in Digraphs [PDF]
Let D be a finite and simple digraph with vertex set V (D). A signed total Roman dominating function (STRDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑x∈N−(v)f(x) ≥ 1 for each v ∈ V (D), where N−(v) consists ...
Volkmann Lutz, Volkmann, Lutz
core +1 more source
ABSTRACT As a periodization that is generally understood to refer to an era of Terrestrial relationships that developed with modernization and nuclearization, the Anthropocene cannot be applied simply to premodern histories and texts. However, it has introduced historians to geological periodization as a mode of describing periods of changed ...
Gwenffrewi J. Morgan
wiley +1 more source

