Results 51 to 60 of about 15,570,600 (248)

The Signed Total Roman k-Domatic Number Of A Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is ...
Volkmann Lutz
doaj   +1 more source

Roman and Total Domination

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

Total Domination Multisubdivision Number of a Graph [PDF]

open access: yes, 2015
The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Lemańska Magdalena   +8 more
core   +2 more sources

Transposable Element Dynamics Drive the Genomic Evolution and Phenotypic Diversification of Allotetraploid Common Carp

open access: yesAdvanced 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

Nonnegative signed total Roman domination in graphs

open access: yesCommunications in Combinatorics and Optimization, 2020
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N(v)}f(x)\ge 0$ for
Nasrin Dehgardi, Lutz Volkmann
doaj   +1 more source

Multimodal Imaging of Hypoxia, Metabolism and pH in Feline Sarcoma Using Hyperpolarized 13C MRI and PET

open access: yesAdvanced Science, EarlyView.
This work presents a clinically deployable simultaneous PET/MRI workflow which integrates hyperpolarized 13C imaging of metabolism and extracellular pH with [18F]FMISO PET to characterize hypoxia, acidosis, and metabolic reprogramming in feline sarcoma.
Martin Grashei   +17 more
wiley   +1 more source

Algorithm aspect on total Roman $\{2\}$-domination number of Cartesian products of paths and cycles

open access: yes, 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

Brain Network Dynamics of Local and Global Predictive Processing in Aging

open access: yesAdvanced Science, EarlyView.
Separation of concurrent whole‐brain networks in source‐reconstructed magnetoencephalography (MEG) data suggests that healthy aging reorganizes, rather than uniformly attenuates, neural responses elicited from hierarchical auditory violations. Enhanced early sensory deviance processing alongside reduced higher‐order cognitive responses suggests a large‐
Mathias Houe Andersen   +9 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

Upper bounds for domination related parameters in graphs on surfaces

open access: yesAKCE 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

Home - About - Disclaimer - Privacy