Results 81 to 90 of about 708,300 (289)
Chilean science teachers' conceptualisations of disability when teaching students with autism
British Educational Research Journal, EarlyView.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
Dominating the Direct Product of Two Graphs through Total Roman Strategies
Mathematics, 2020 Given a graph G without isolated vertices, a total Roman dominating function for G is a function f:V(G)→{0,1,2} such that every vertex u with f(u)=0 is adjacent to a vertex v with f(v)=2, and the set of vertices with positive labels induces a graph of ...
Abel Cabrera Martínez +3 more
doaj +1 more source
Utterance evolution: the road to generative, combinatorial communicators
Biological Reviews, EarlyView.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
Biological Reviews, EarlyView.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
Roman domination number on cardinal product of paths and cycles
Croatian Operational Research Review, 2015 In this paper, the authors have determined certain upper and lower bounds for Roman domination numbers on cardinal products for any two graphs and some exact values for the cardinal product of paths and cycles.
Antoaneta Klobučar, Ivona Puljić
doaj +1 more source
On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree
Mathematics, 2020 A dominating set in a graph G is a set of vertices S ⊆ V ( G ) such that any vertex of V − S is adjacent to at least one vertex of S .
Zehui Shao +4 more
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT The aim of this study is to examine the impact of corruption control, as a public institutional mechanism, on hazardous waste emissions of private sector entities. We also examine the extent to which Agenda 2030 moderates the relationship. We analyse data from the top 500 global companies.
Babajide Oyewo +3 more
wiley +1 more source
On hop Roman domination in trees
Communications in Combinatorics and Optimization, 2019 Summary: Let \(G=(V,E)\) be a graph. A subset \(S\subset V\) is a hop dominating set if every vertex outside \(S\) is at distance two from a vertex of \(S\). A hop dominating set \(S\) which induces a connected subgraph is called a connected hop dominating set of \(G\).
Jafari Rad, Nader, Poureidi, Abolfazl
openaire +2 more sources
Navigating the Double Edge of Product‐Service Systems: User Behavior, Adoption, and Rebound Effects
Business Strategy and the Environment, EarlyView.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
Weak Roman domination in graphs
Discussiones Mathematicae Graph Theory, 2011 0(w) = f(w) if w 2 V − fu,vg, has no undefended vertex. The weight of f is w(f) = P v2V f(v). The weak Roman domination number, denoted by r(G), is the minimum weight of a WRDF in G. In this paper, we characterize the class of trees and split graphs for which r(G) = (G) and find r-value for a caterpillar, a 2 n grid graph and a complete binary tree.
T. N. M. Malini Mai +1 more
openaire +2 more sources