Results 61 to 70 of about 96,720 (286)
An Empirical Study of Retrieval-enhanced Graph Neural Networks
Graph Neural Networks (GNNs) are effective tools for graph representation learning. Most GNNs rely on a recursive neighborhood aggregation scheme, named message passing, thereby their theoretical expressive power is limited to the first-order Weisfeiler ...
Song, Linfeng +7 more
core
Matching in power graphs of finite groups [PDF]
Funding: The author Swathi V V acknowledges the support of Council of Scientific and Industrial Research, India (CSIR) (Grant No-09/874(0029)/2018-EMR-I), and DST, Government of India, ‘FIST’ (No.SR/FST /MS-I/2019/40).The power graph P(G) of a finite ...
Swathi, V. V. +2 more
core +1 more source
The modern power system is becoming increasingly complex, and the uncertainty in the operation of each link has intensified the possibility of risks emerging.
Zhixin Suo +7 more
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
On some properties of enhanced power graph
Given a group $G$, the enhanced power graph of $G$ denoted by $\mathcal{G}_e(G)$, is the graph with vertex set $G$ and two distinct vertices $x, y$ are edge connected in $\mathcal{G}_e(G)$ if there exists $z\in G $ such that $x=z^m$ and $ y=z^n $, for some $m, n\in \mathbb{N}$. In this article, we characterize the enhanced power graph $\mathcal{G}_e(G)$
Bera, Sudip, Bhuniya, A. K.
openaire +2 more sources
Efficiency assessment using fuzzy production possibility set and enhanced Russell Graph measure [PDF]
This paper studies the efficiency assessment of Decision Making Units (DMUs) when their inputs and outputs are fuzzy sets. An axiomatic derivation of the fuzzy production possibility set is presented and a fuzzy enhanced Russell graph measure is ...
Arana Jiménez, Manuel +5 more
core +1 more source
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
Enhanced power graph from the power graph of a group
The power graph of a group $G$ is a graph with vertex set $G$, where two distinct vertices $a$ and $b$ are adjacent if one of $a$ and $b$ is a power of the other. Similarly, the enhanced power graph of $G$ is a graph with vertex set $G$, where two distinct vertices are adjacent if they belong to the same cyclic subgroup.
Pote, Amar S., Kadu, Ganesh S.
openaire +2 more sources
ON NEIGHBOURHOODS IN THE ENHANCED POWER GRAPH ASSOCIATED WITH A FINITE GROUP
AbstractWe investigate neighbourhood sizes in the enhanced power graph (also known as the cyclic graph) associated with a finite group. In particular, we characterise finite p-groups with the smallest maximum size for neighbourhoods of a nontrivial element in its enhanced power graph.
MARK L. LEWIS, CARMINE MONETTA
openaire +2 more sources

