Results 251 to 260 of about 96,720 (286)

HKD-CPI: high-order knowledge distillation enhanced inductive compound-protein interaction prediction. [PDF]

Bioinformatics
He Z, Liu X, Jiang Y, Xu J, Lin Y, Jin S, Wei L, Wang Y.   +7 more
europepmc   +1 more source

A multichannel MEG time-frequency analysis framework for detecting stage -specific effects of spatial distraction in visual-spatial working memory. [PDF]

Front Neurosci
Li Z, Liang Q, Xiao W, Li T, Chen Z, Tang X, Ouyang Y, Huang Z, Sun L, Tang X, Wang X.   +10 more
europepmc   +1 more source

Federated two-edge graph attention network with weighted global aggregation for electricity consumption demand forecasting. [PDF]

Sci Rep
Yang M, Ren J, Zeng L, Yang X, Li S, Ai Y, Zheng K.   +6 more
europepmc   +1 more source

Prior-Knowledge-Guided Graph Attention Network for Fault Diagnosis of Engine Valve Clearance. [PDF]

Sensors (Basel)
Li M, Wen J, Yang X, Hu Y, Li X, Shi Z.
europepmc   +1 more source

A spectral- topological network signature of drug-resistant epilepsy: a phase 1-2 study on resting-state EEG-based diagnostic biomarkers of drug resistance. [PDF]

Neuroimage Clin
Sancetta BM, Lanzone J, Matarrese MAG, Lippa G, Mesta M, Ricci L, Sferruzzi M, Carbone SP, Veronese L, Conti G, Brunetti M, Zappasodi F, Di Lazzaro V, Tombini M, Assenza G.   +14 more
europepmc   +1 more source

Research on structural damage identification based on temporal power flow graph network. [PDF]

Sci Rep
Wu X, Lan C, Zhang C, Zhang X, Zhang R, Zhu L.   +5 more
europepmc   +1 more source

On enhanced power graphs of finite groups

Journal of Algebra and Its Applications, 2018
Given a group [Formula: see text], the enhanced power graph of [Formula: see text], denoted by [Formula: see text], is the graph with vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are edge connected in [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] and ...
Bera, Sudip, Bhuniya, A. K.
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On enhanced power graphs of certain groups

Discrete Mathematics, Algorithms and Applications, 2020
The enhanced power graph [Formula: see text] of a group [Formula: see text] is a simple undirected graph with vertex set [Formula: see text] and two distinct vertices [Formula: see text] are adjacent if both [Formula: see text] and [Formula: see text] belongs to same cyclic subgroup of [Formula: see text].
Sandeep Dalal, Jitender Kumar
openaire   +1 more source

Enhanced power graphs are weakly perfect [PDF]

Australas. J Comb., 2023
Summary: A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group \(G\) is weakly perfect: its clique number and chromatic number are equal to the maximum order of an element of \(G\). The proof requires a combinatorial lemma. We give some remarks about related graphs.
Peter J. Cameron, Veronica Phan
openaire   +1 more source