Results 131 to 140 of about 8,623,913 (295)
Journal of Organizational Behavior, EarlyView.ABSTRACT People with disabilities (PWD) often face barriers to inclusion at work. To tackle this challenge, past research focused on the role of organizations to create more inclusive workplaces. What remains understudied, however, is the role that PWD often take themselves in shaping their inclusion experiences.
Louisa Antonia Riess +2 more
wiley +1 more source
Workplace Allyship: An Integrative Review and Agenda for Future Research
Journal of Organizational Behavior, EarlyView.ABSTRACT Workplace allyship has emerged as a key construct in the literature on diversity, equity, and inclusion. Although research on workplace allyship has expanded rapidly in recent years, advancement in this research stream is limited by conceptual ambiguity and fragmentation across numerous perspectives.
Maria Funk +2 more
wiley +1 more source
Validation of the Investigator's Global Assessment Scale for Epidermolysis Bullosa Simplex
JEADV Clinical Practice, EarlyView.ABSTRACT Background There is a lack validated outcome measures to assess wound severity in epidermolysis bullosa simplex (EBS). Objectives To assess the reliability and validity of the Investigator's Global Assessment (IGA) scale and a newly developed palms/soles subscale through in‐clinic scoring and review of patient‐submitted photographs.
Pirunthan Pathmarajah +13 more
wiley +1 more source
Greedy clique decompositions and the Turán numbers
European Journal of Combinatorics, 1995 A greedy \(p\)-clique decomposition is a decomposition of the edge set of a graph into cliques of order at least \(p\). At each step of this decomposition the edges of one maximal clique of order at least \(p\) are removed until none remain, then the remaining edges, one by one, are removed. Let \(G\) be a graph of order \(n\). It is shown that the sum
openaire +1 more source
The Kaohsiung Journal of Medical Sciences, EarlyView.ABSTRACT The instability of atherosclerotic plaques, particularly intraplaque hemorrhage (IPH), drives life‐threatening cardiovascular events, a process in which vascular smooth muscle cell (VSMC)‐derived foam cells play a significant role. We aim to identify key biomarkers associated with VSMC‐derived foam cells and IPH by analyzing data from human ...
Ling‐Lin Qian +4 more
wiley +1 more source
Psychology &Marketing, EarlyView.ABSTRACT AI agents are typically deployed with gender cues that match traditional role expectations, such as female voices or avatars in assistive and support roles, because stereotype‐congruent designs enhance consumer adoption, trust, and engagement. However, prior research suggests that this practice risks entrenching occupational gender stereotypes
Marius Claudy +4 more
wiley +1 more source
P A SIGNED CLIQUE EDGE-DOMATIC NUMBER OF A GRAPH
, 2015 : In this paper, the problem of signed clique edge-domatic number is considered for any finite,nonempty and simple graph G with the maximal clique K ω . At first,using induction method, we study the signed clique edge-domatic number for a class of graphs
Zhang Li-Xian, §, Lu Xin-Zhong
core
Interdiction Models and Heuristics for Graph Propagation
Networks, EarlyView.ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
A tensor's spectral bound on the clique number
Discrete MathematicsIn this paper, we study the spectral radius of the clique tensor A(G) associated with a graph G. This tensor is a higher-order extensions of the adjacency matrix of G. A lower bound of the clique number is given via the spectral radius of A(G). It is an extension of Nikiforov's spectral bound and tighter than the bound of Nikiforov in some classes of ...
Chunmeng Liu, Changjiang Bu
openaire +2 more sources
List-coloring claw-free graphs with small clique number
, 2012 Chudnovsky and Seymour proved that every connected claw-free graph that contains a stable set of size 3 has chromatic number at most twice its clique number.
Louis Esperet +2 more
core