Results 51 to 60 of about 9,767,318 (248)

Graphs with Large Hop Roman Domination Number [PDF]

Computer Science Journal of Moldova, 2019
A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A Roman dominating function on a graph $G=(V,E)$ is a function $f: V(G) \longrightarrow \{0, 1, 2\}$ satisfying the ...
E. Shabani, N. Jafari Rad, A. Poureidi
doaj  

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, Sheikholeslami Seyed Mahmoud, Soroudi Marzieh, Volkmann Lutz, Liu Xinmiao   +4 more
doaj   +1 more source

On the D-differential of a graph

AKCE International Journal of Graphs and Combinatorics, 2022
Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj   +1 more source

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 Distance Roman Domination Numbers of Graphs

Discussiones Mathematicae Graph Theory, 2013
Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0, 1, 2} such that for every vertex with label 0, there is a vertex with label 2 at distance at most k ...
Aram Hamideh, Norouzian Sepideh, Sheikholeslami Seyed Mahmoud   +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

Weak signed Roman k-domination in digraphs [PDF]

Opuscula Mathematica
Let \(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

Hydration Behavior of Tricalcium Silicate in Seawater Relevant Salt Systems: A Hybrid Study with the Aid of Machine Learning

Advanced Intelligent Discovery, EarlyView.
The hydration behavior of C3S in seawater‐relevant solutions is studied based on experiments, boundary nucleation and growth (BNG) modeling, and machine learning. The main ions included in seawater modify hydration mechanisms, with MgCl2 showing the strongest acceleration effect at the same concentration.
Yanjie Sun, Chen Zhang, Ting Zhang, Mengze Hong, Peiliang Shen, Chi Sun Poon, Gang Li   +6 more
wiley   +1 more source

Powers of Large Matrices on GPU Platforms to Compute the Roman Domination Number of Cylindrical Graphs

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, E. M. Garzon, M. L. Puertas   +2 more
doaj   +1 more source

Singed Total Domatic Number of a Graph [PDF]

, 2010
The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol, Walikar, H.B., Kishori P.Narayankar   +2 more
core   +1 more source