Results 51 to 60 of about 9,286,296 (115)

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +1 more source

Double domination in lexicographic product graphs [PDF]

, 2020
[EN] In a graph G, a vertex dominates itself and its neighbours. A subset S subset of V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice.
Cabrera Martínez, Abel, Rodríguez Velázquez, Juan Alberto, Rodríguez-Velázquez, J.A., Cabrera García, Suitberto   +3 more
core   +1 more source

Bias‐Triggered Conductivity Relaxation (BCR): A Unique Tool to Simultaneously Investigate Thermodynamics, Kinetics, and Electrostatic Effects of Oxygen Reactions in MIEC Thin Films

Advanced Materials, Volume 38, Issue 43, 3 August 2026.
This work develops bias‐triggered conductivity relaxation as a novel technique to study oxygen reactions in mixed ionic‐electronic conducting thin films by integrating electrochemical titration and electrical conductivity relaxation to achieve synchronous multi‐parameter characterization, providing simultaneous electronic, ionic, and extraordinarily ...
Alexander Stangl, Alexander Schmid, Adeel Riaz, Jürgen Fleig, Arnaud Badel   +4 more
wiley   +1 more source

Double Roman domination in generalized Petersen graphs P(ck, k)

, 2022
A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3}, satisfying the condition that every vertex u for which f(u)=1 is adjacent to at least one vertex assigned 2 or 3, and every vertex u with f(u)=0 is adjacent to at ...
Janez Žerovnik, Žerovnik, Janez, Rupnik Poklukar, Darja, Darja Rupnik Poklukar   +3 more
core   +1 more source

Further Results on the Total Roman Domination in Graphs [PDF]

, 2020
[EN] Let G be a graph without isolated vertices. A function f:V(G)-> {0,1,2} is a total Roman dominating function on G if every vertex v is an element of V(G) for which f(v)=0 is adjacent to at least one vertex u is an element of V(G) such that f(u)=
Cabrera Martínez, Abel, Suitberto Cabrera García, Abel Cabrera Martínez, Carrión García, Andrés, Cabrera García, Suitberto, Andrés Carrión García   +5 more
core   +1 more source

Triple Connected Domination Number of a Graph [PDF]

, 2012
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan, T.Subramanian, Joseph, Paulraj, J.Paulraj Joseph, G.Mahadevan, Avadayappan, Selvam, Subramanian, T., Mahadevan, G.   +7 more
core   +1 more source

Total Roman domination for proper interval graphs

, 2020
A function f:V → {0,1,2} is a total Roman dominating function (TRDF) on a graph G=(V,E) if for every vertex v ∈ V with f(v) = 0 there is a vertex u adjacent to v with f(u) = 2 and for every vertex v ∈ V with f(v) > 0 there exists a vertex u ∈ NG(v ...
Abolfazl Poureidi
core   +1 more source

On The Total Roman Domination in Trees [PDF]

, 2019
A total Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the following conditions: (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2 and (ii) the subgraph of G induced by ...
M. Soroudi, Jafar Amjadi, Sheikholeslami, Seyed Mahmoud, Sheikholeslami Seyed Mahmoud, Amjadi, Jafar, Amjadi Jafar, Seyed Mahmoud Sheikholeslami, Soroudi Marzieh, Soroudi, Marzieh   +8 more
core   +1 more source

The restrained double Roman domination and graph operations

A restrained double Roman dominating function (RDRD-function) on a graph G is a function f:V(G)→{0, 1, 2, 3} that satisfies two conditions: (1) If f(v)
Yue, Jun, Gao, Zhipeng, Xi, Changqing
core   +3 more sources

Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_mBox P_n$ [PDF]

Roman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, $[k]$-Roman domination provides a unified framework that generalizes Roman, double Roman, and ...
Žerovnik, Janez, Brezovnik, Simon
core   +1 more source