Results 111 to 120 of about 1,370 (272)
Graphs with Large Hop Roman Domination Number [PDF]
Computer Science Journal of Moldova, 2019 A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A Roman dominating function on a graph $G=(V,E)$ is a function $f: V(G) \longrightarrow \{0, 1, 2\}$ satisfying the ...
E. Shabani, N. Jafari Rad, A. Poureidi
doaj
From Custom to Court: The Evolution of Mediation in European Legal Systems
Conflict Resolution Quarterly, EarlyView.ABSTRACT This article traces how European mediation has repeatedly rebalanced three variables—(1) the source of mediator authority, (2) the degree of institutionalization, and (3) the operative meaning of voluntariness—from antiquity to the present. Using three periods—Proto‐Mediation (c. 500 BCE–c. 1750), Classical Mediation (c.
Viktoriia Hamaiunova
wiley +1 more source
Total Weak Roman Domination in Graphs
, 2019 Given a graph G = ( V , E ) , a function f : V → { 0 , 1 , 2 , ⋯ } is said to be a total dominating function if ∑ u ∈ N ( v ) f ( u ) > 0 for every v ∈ V , where N ( v ) denotes the open ...
Juan A. Rodríguez-Velázquez +2 more
core +1 more source
Public Sustainability: Thematic Mapping, Theoretical Approaches and Emerging Lines of Action
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT The paucity of research analysing thematic persistence in public sustainability limits our understanding of how this field of research evolves and reconfigures itself. The present paper addresses this gap through a longitudinal bibliometric analysis of 692 publications processed with SciMAT. The methodology combines co‐word analysis, strategic
Laila Ribii Khalifi +2 more
wiley +1 more source
, 2000 A Roman dominating function on a graph G =(V,E) is a function f: V →{0, 1, 2} satisfying the condition that every vertex u for which f(u) =0 is adjacent to at least one vertex v for which f(v)=2.Theweight of a Roman dominating function is the value f(V) =
S. T. Hedetniemi +3 more
core
Perfect roman domination in regular graphs
, 2018 A perfect Roman dominating function on a graph G is a function f : V (G) ? {0,1,2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2.
Michael Henning +3 more
core +1 more source
How 1st‐Tier Suppliers Respond to Green Public Procurement Policies: An Empirical Analysis
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT This article analyses how 1st‐tier suppliers to public organisations respond operationally to Green Public Procurement (GPP) policies. Through a multiple case study of 12 Italian firms operating in different sectors, we develop a classification of suppliers' responses, identifying two interrelated macro‐types: internal operations realignment ...
Antonio Cavallin Toscani, Andrea Vinelli
wiley +1 more source
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
Pre‐industrial land‐use limits contemporary shrub encroachment in the French Alps
Ecography, EarlyView.Shrub encroachment has become a global phenomenon in recent decades. While global warming in the Arctic is often cited as the primary cause, human‐managed mountain regions have experienced intense historical land‐use that may also play a considerable role.
Baptiste Nicoud +6 more
wiley +1 more source
On The Co-Roman Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G = (V, E) be a graph and let f : V (G) → {0, 1, 2} be a function. A vertex v is said to be protected with respect to f, if f(v) > 0 or f(v) = 0 and v is adjacent to a vertex of positive weight. The function f is a co-Roman dominating function if (i)
Shao Zehui +4 more
doaj +1 more source