Results 41 to 50 of about 8,636,707 (226)
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 This work presents a simplified extended‐batch adsorber analogue model (e‐BAAM) to quantify key performance metrics such as purity, recovery, and energy trends for various pressure swing adsorption (PSA) process cycles for CO2$$ {\mathrm{CO}}_2 $$ capture.
Gwyneth Liske, Arvind Rajendran
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
Timeline of key academic milestones and individuals that shaped chemical engineering at FQ‐UNAM and in Mexico. Abstract One hundred years after the beginning of the teaching of Chemical Engineering in Mexico, which started in 1925 in the former National School of Chemical Sciences, currently Faculty of Chemistry (FQ) at National Autonomous University ...
Patricia Pérez‐Salinas +2 more
wiley +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
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 +3 more
core +1 more source
ABSTRACT Recent regulatory initiatives, including the EU Corporate Sustainability Reporting Directive (CSRD), are reinforcing the demand for more structured, transparent, and accessible sustainability reporting. However, empirical evidence on how digital tools influence the narrative dimension of these disclosures remains limited.
Francesco Sotti +2 more
wiley +1 more source
Double Roman domination in generalized Petersen graphs P(ck, k)
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 +3 more
core +1 more source
Double domination in lexicographic product graphs [PDF]
[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 +3 more
core +1 more source
ABSTRACT In current dynamic time history assessment protocols, ground motion recordings are mostly oriented along fixed sensor directions. Consequently, the orientation of the principal resultant of rupture energy, which may control the maximum structural demand, remains undefined, precluding consistent correlation with physically detrimental ...
Santiago Londono‐Lopez +4 more
wiley +1 more source
Triple Connected Domination Number of a Graph [PDF]
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 +7 more
core +1 more source

