Results 91 to 100 of about 129,618 (274)
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
The Integration of phoenician communities in the Iberian Peninsula during the Roman Empire from a postcolonial perspective [PDF]
The goal of this paper is to research on the analysis of the process of integration experienced by the Phoenician-Punic communities of the Iberian Peninsula in the Roman world, from the end of the Second Punic War (206 BCE) until Flavian times (mid-1st ...
Machuca Prieto, Francisco
core
On hop Roman domination in trees
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
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
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
Weak Roman domination in graphs
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
Tensions of Sustainability Logics: Performance of a Company Utilizing a Sustainable Business Model
ABSTRACT In recent years, companies have used sustainable business models to gain a competitive advantage. However, there are tensions due to the inconsistency between social, environmental, and economic logic in sustainable business models, making it difficult for companies to change. To understand the existing tensions and interactions between logics,
Ann‐Kristin Thienemann
wiley +1 more source
Quasi total double Roman domination in graphs
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
S. Kosari +4 more
doaj +1 more source
Catharine Macaulay’s Republican Conception of Social and Political Liberty [PDF]
Catharine Macaulay was one of the most significant republican writers of her generation. Although there has been a revival of interest in Macaulay amongst feminists and intellectual historians, neo-republican writers have yet to examine the theoretical ...
Coffee, Alan M. S. J.
core
Innovative Minds, Sharing Hesitations: Open Innovation Meets Green Entrepreneurship
ABSTRACT This study examines the relationships between innovative thinking tendency, knowledge hiding behavior within organizations, open innovation, and green entrepreneurship among employees in technology firms. Data collected from 386 participants were analyzed using cluster analysis and structural equation modeling.
Ebru Polat
wiley +1 more source

