Results 111 to 120 of about 8,970,965 (255)
Partial characterizations of clique-perfect graphs
, 2008 A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques.
Guillermo Durán +2 more
core
Small Community Businesses in Slums: A Perspective on Kenyan Slum Networks
Strategic Change, EarlyView.ABSTRACT Despite extensive research on networks, the relational dimensions and structures cocreated by small community businesses and cooperative societies through everyday entrepreneurship in slum neighborhoods remain undertheorized. Drawing upon 1166 small community businesses, we conceptualize the relational dimensions and structures underlying ...
Amon Simba +3 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
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
Onboarding and Agency: Responding to Episodic Loneliness in Immersive Services
Psychology &Marketing, EarlyView.ABSTRACT Loneliness is a growing concern in long‐duration immersive services, where consumers not only transition into the service but also experience multiple identity transitions and life events while in the service. We argue that loneliness in these settings emerges not only as a chronic experience from a lack of social opportunities, but also ...
Alexandra Zimbatu +3 more
wiley +1 more source
Consumers Overestimate How Much Others Value Valenced Content
Psychology &Marketing, EarlyView.ABSTRACT Consumers often decide what to share by estimating how much others will value a piece of content. We show that these estimates are systematically miscalibrated for emotionally valenced material. Across four studies spanning controlled tasks and naturalistic contexts, people overestimated others’ valuation of valenced, especially negative ...
Fengshu Xie, Bruce Doré, Laurette Dubé
wiley +1 more source
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
Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks
Networks, EarlyView.ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone +3 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