Results 91 to 100 of about 1,275 (240)
A Note on Roman Domination of Digraphs
A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S is adjacent from at least one vertex in S. The domination number of a digraph D, denoted by γ(D), is the minimum cardinality of a dominating set of D.
Chen Xiaodan, Hao Guoliang, Xie Zhihong
doaj +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
Bounds on the global double Roman domination number in graphs [PDF]
Let $G$ be a simple graph of order $n$ and let $\gamma_{gdR}(G)$ be the global double Roman domination number of $G$. In this paper, we give some upper bounds on the global double Roman domination number of $G$.
Seyed Mahmoud Sheikholeslami +7 more
core +1 more source
ABSTRACT Existing literature indicates that transformational leadership in supply chains is critical to sustainability; however, little is known about how this leadership influences sustainability. The empirical literature has provided minimal focused analysis of transformational supply chain leadership and its effects on sustainability performance ...
Ishmael Nanaba Acquah +2 more
wiley +1 more source
ABSTRACT The intersection between corporate entities and political institutions—commonly referred to as corporate political connections (CPCs)—significantly influences firms' strategic conduct and their environmental obligations. Although academic interest in this area has grown, the ethical dimensions of CPCs in relation to environmental ...
Ahmed A. Elamer +2 more
wiley +1 more source
Global total Roman domination in graphs [PDF]
A total Roman dominating function (TRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions (i) every vertex [Formula: see text] for which [Formula: see text] is adjacent at least one vertex [Formula: see text ...
J. Amjadi +2 more
core +1 more source
Signed Total Roman Domination in Digraphs
Let D be a finite and simple digraph with vertex set V (D). A signed total Roman dominating function (STRDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑x∈N−(v)f(x) ≥ 1 for each v ∈ V (D), where N−(v) consists ...
Volkmann Lutz
doaj +1 more source
Knowledge Management and AI‐Driven Green Practices for Sustainable Performance
ABSTRACT Organizations increasingly face strategic pressure to translate sustainability‐oriented knowledge and digital transformation initiatives into measurable environmental and organizational outcomes. In response, this study investigates how green knowledge management (GKM) contributes to sustainable business performance through the organizational ...
Hafiz Mudassir Rehman +3 more
wiley +1 more source
Roman Domination over Some Graph Classes [PDF]
International audienceA Roman dominating function of a graph $G=(V,E)$ is a function $f:V \rightarrow \{0,1,2\}$ such that every vertex $x$ with $f(x)=0$ is adjacent to at least one vertex $y$ with $f(y)=2$.
Kloks, Ton +7 more
core +1 more source
ABSTRACT A novel anatomical description and radiological finding, related to the anatomical course of the terminal fibular artery (FibA) was recently reported. In the article, the authors found the terminal FibA to change its course, from being posterior and medial to the fibula to surface anteriorly and laterally before residing below the tibiofibular
Sebastian Kirdar‐Smith +5 more
wiley +1 more source

