Results 81 to 90 of about 862,623 (267)
Total roman domination in digraphs
, 2021 Let D be a nite and simple digraph with vertex set V (D). A Roman dominating function (RDF) on a digraph D is a function f : V (D) → {0; 1; 2} satisfying the condition that every vertex v with f(v) = 0 has an in-neighbor u with f(u) = 2. The weight of an
Zhuang, Wei, Hu, Kangxiu, Hao, Guoliang
core
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 +7 more
core +1 more source
Reframing Colonial Korea's Forests Through Protection Forests: The Forests of Joseon (1938)
Berichte zur Wissenschaftsgeschichte, EarlyView.This study examines The Forests of Joseon (1938), a forestry survey compiled by Tokumitsu Nobuyuki under Japanese colonial rule, as a key site of epistemic negotiation between imperial forestry science and Korean indigenous knowledge. Focusing on bíbo forests—geomantic forests believed to regulate energy flow between mountains and villages—the paper ...
Soyeong Park, Jeong‐Hann Pae
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
, 2010 A Roman dominating function of a graph G is a function f : V (G) → {0, 1, 2} such that whenever f(v) = 0 there xists a vertex u adjacent to v such that f(u) = 2. The weight of f is w(f) = Pv∈V (G) f(v).
劉俊宏, Liu, Chun-Hung
core
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
Perfect Roman and Perfect Italian Domination of Cartesian Product Graphs
Scientific Journal of King Faisal University: Basic and Applied SciencesFor a graph G=(V,E), a function f:V→{0,1,2} is a perfect Roman dominating function (PRDF) on G if every v∈V with f(v)=0 is adjacent to exactly one vertex u with f(u)=2. The sum ∑_(v∈V)^▒f (v) is the weight w(f) of f.
Ahlam Almulhim
doaj +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
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
A note on the edge Roman domination in trees
Electronic Journal of Graph Theory and Applications, 2017 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