Results 71 to 80 of about 1,275 (240)
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
Abstract Body procurement at The University of Sydney has a long history. Anatomy legislation (1881 Anatomy Act) modeled on the British Anatomy Act 1832 legalized procurement of unclaimed bodies from public institutions for anatomical dissection at licensed Schools of Anatomy, effectively conferring the University of Sydney an exclusive license until ...
Rebekah A. Jenkin, Kevin A. Keay
wiley +1 more source
A note on the edge Roman domination in trees
A subset $X$ of edges of a graph $G$ is called an \textit{edgedominating set} of $G$ if every edge not in $X$ is adjacent tosome edge in $X$. The edge domination number $\gamma'(G)$ of $G$ is the minimum cardinality taken over all edge dominating sets of
Nader Jafari Rad
doaj +1 more source
Abstract In response to globalisation, teacher education programmes worldwide are tasked with preparing globally competent teachers (GCTs). Prevailing conceptions of global competence are largely derived from Western‐centric humanistic, neoliberal and transformative narratives, creating a complex landscape for teacher identity formation.
Ji Ying
wiley +1 more source
Roman Domination Cover Rubbling [PDF]
In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of ...
Carney, Nicholas
core +1 more source
Mixed Roman Domination in Graphs [PDF]
Let G= (V, E) be a simple graph with vertex set V and edge set E. A mixed Roman dominating function (MRDF) of G is a function f: V∪ E→ { 0 , 1 , 2 } satisfying the condition every element x∈ V∪ E for which f(x) = 0 is adjacent or incident to at least one
Haynes, Teresa W. +2 more
core +1 more source
Utterance evolution: the road to generative, combinatorial communicators
ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford +2 more
wiley +1 more source
Graphs with large Roman domination number [PDF]
A Roman dominating function (RDF) on a graph tt = (V, E) is a function f : V (tt) 0, 1, 2 satisfying the condition that every vertex with label 0 is adjacent to a vertex with label 2. The weight of an RDF f is w(f ) = v V f (v).
Jawatankuasa Kerja PSM UPM
core
On the Roman domination number of a graph [PDF]
A Roman dominating function of a graph G is a labeling f:V(G)⟶{0,1,2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑v∈V(G)f(v) over such functions.
Favaron, O. +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

