Results 31 to 40 of about 9,074,588 (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
Hop total Roman domination in graphs
In this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 there exists ...
M. Soroudi +3 more
core +1 more source
ABSTRACT Medieval and early modern drowned villages in the intertidal zone of the Scheldt estuary (the Netherlands) constitute intriguing yet largely understudied components of north‐western Europe's underwater cultural heritage. Despite their high archaeological potential as time capsules of past settlement landscapes, research has remained limited ...
Jan Trachet +9 more
wiley +1 more source
Total Roman domination for proper interval graphs
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
Chilean science teachers' conceptualisations of disability when teaching students with autism
Abstract This study examines how Chilean secondary science teachers conceptualise disability when teaching students with autism in integrated classroom settings. Grounded in critical disability studies, the research employs a qualitative story‐completion method, using a fictional classroom scenario to prompt teachers to construct narratives that reveal
Alexis Gonzalez‐Donoso +1 more
wiley +1 more source
Quasi-total Roman Domination in Graphs [PDF]
[EN] A quasi-total Roman dominating function on a graph G=(V,E) is a function f:V ->{0,1,2}satisfying the following: Every vertex for which u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2, and If x is an isolated vertex in ...
González Yero, Ismael +3 more
core +1 more source
ABSTRACT Heat stress (HS) is an increasing threat to male reproductive health, disrupting spermatogenesis through complex and interdependent cellular responses within the seminiferous epithelium. Although excessive reactive oxygen species (ROS) production is a hallmark of HS, ROS also act as central regulators of cell fate decisions beyond their role ...
Ribrio Ivan Tavares Pereira Batista
wiley +1 more source
Navigating the Double Edge of Product‐Service Systems: User Behavior, Adoption, and Rebound Effects
ABSTRACT Product‐service systems (PSS) have been considered a promising approach to operationalizing the circular economy. Although many studies have outlined the potential sustainability gains of PSS solutions, it is still unclear what factors drive PSS adoption and how behavioral changes result in rebound effects, undermining their potential ...
Marina Fernandes Aguiar +3 more
wiley +1 more source
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
ABSTRACT Despite the global emphasis on simultaneous achievement of higher growth and lower pollution (green growth), the dynamic link between eco‐innovation and CO2 emissions remains inadequately understood globally and specifically in Africa, with a complex and diverse institutional and regulatory landscape.
Idorenyin J. Okon +2 more
wiley +1 more source

