Results 41 to 50 of about 1,161 (229)

On Hop Roman Domination in Trees [PDF]

Communications in Combinatorics and Optimization, 2019
Let $G=(V,E)$ be a graph. A subset $S\subset V$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$.
N. Jafari Rad, A. Poureidi
doaj   +1 more source

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

Advanced 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, Tanja Groll, Stephanie Kahl, Silke Baer, Elisabeth Bliemsrieder, Frits H. A. van Heijster, Andre Wendlinger, Pascal Wodtke, Jorge Cabello, Susan Notohamiprodjo, Christian Lohrmann, Markus Schwaiger, Wolfgang A. Weber, Katja Steiger, Andrea Meyer‐Lindenberg, Johannes Hirschberger, Christine Baumgartner, Franz Schilling   +17 more
wiley   +1 more source

Brain Network Dynamics of Local and Global Predictive Processing in Aging

Advanced 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, Gemma Fernández‐Rubio, David R. Quiroga‐Martinez, Mattia Rosso, Mathias Klarlund, Kit Melissa Larsen, Hartwig Roman Siebner, Morten L. Kringelbach, Peter Vuust, Leonardo Bonetti   +9 more
wiley   +1 more source

Effect of vertex deletion on the weak Roman domination number of a graph

AKCE International Journal of Graphs and Combinatorics, 2019
Let be a graph and be a function. The weight of a vertex is and a vertex with weight is said to be undefended with respect to , if it is not adjacent to a vertex with positive weight. The function is a weak Roman dominating function (WRDF) if each vertex
P. Roushini Leely Pushpam, M. Kamalam
doaj   +2 more sources

Experimental Demonstration of Temporally Aware Fault‐Tolerant Sensor Fusion Using Memristive Associative Learning

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, Ashfak Nehal, Dmitrii Semenov, Roman Sotner, Sayani Majumdar   +4 more
wiley   +1 more source

The Perfect Roman Domination Number of the Cartesian Product of Some Graphs

Journal of Mathematics, 2022
A perfect Roman dominating function on a graph G is a function f:VG⟶0,1,2 for which every vertex v with fv=0 is adjacent to exactly one neighbor u with fu=2. The weight of f is the sum of the weights of the vertices.
Ahlam Almulhim, Abolape Deborah Akwu, Bana Al Subaiei   +2 more
doaj   +1 more source

Nickel‐Free Perovskite Solar Cells Enabled by Self‐Assembled Monolayers: A Pathway to Efficient and Recyclable Devices

Advanced Energy Materials, EarlyView.
Replacing toxic NiOx with phenyl‐substituted phosphonic‐acid carbazole monolayers (Ph‐5PACz) yields inverted perovskite solar cells that are efficient and recyclable. The nickel‐free interface reaches 25.3% efficiency and enables closed‐loop ITO recovery with near‐98% performance retention, while life‐cycle and techno‐economic analyses confirm lower ...
Yanxue Wang, Roman Kučera, Sinuhé Perea‐Puente, Mykhailo Sytnyk, Andrew Hainer, Zijian Peng, Savannah Bennett, Juan S. Rocha‐Ortiz, Albert These, Hakan U Dag, Qi Fan, Anastasia Barabash, Zhenni Wu, Chaohui Li, Jens Hauch, Olga Kasian, Christoph J. Brabec, Ian Marius Peters   +17 more
wiley   +1 more source

Further results on independent double roman trees

AKCE International Journal of Graphs and Combinatorics, 2022
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and every vertex v
A. Rahmouni, H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami   +3 more
doaj   +1 more source

Signed total double Roman dominating functions in graphs

AKCE International Journal of Graphs and Combinatorics
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, (ii) every vertex v with f(v) = 1 has at least one neighbor w with [Formula: see ...
L. Shahbazi, H. Abdollahzadeh Ahangar, S. M. Sheikholeslami   +2 more
openaire   +2 more sources

Not All Agreements Are Equal: Heterogeneous Effects of RTAs on Latin American Agri‐Food Exports, 1990–2019

Agribusiness, EarlyView.
ABSTRACT Since the final decade of the 20th century, Latin American countries have increasingly regarded the signing of regional trade agreements (RTAs) as a promising strategy for expanding their exports. Within this context, the main objective of this study is to assess the impact of RTAs on agri‐food exports in Latin America over the period 1990 ...
María‐Isabel Ayuda, Ignacio Belloc, Vicente Pinilla   +2 more
wiley   +1 more source