Results 251 to 260 of about 5,608,609 (280)

A hybrid framework combining adaptive graph learning and global temporal attention for skeleton-based action recognition. [PDF]

Sci Rep
JunZhang C, GuanLi Y.
europepmc   +1 more source

stMixer for Scalable Mosaic Integration and Label Transfer in Spatial Histology and Multi-Omics. [PDF]

Adv Sci (Weinh)
Yang Q, Wang Y, Chen L, Zuo C.
europepmc   +1 more source

BOMIFA: biologically informed multi-omics integration with graph contrastive learning for cancer prognosis in women. [PDF]

Brief Bioinform
Lu Z, Wang J, Liang Y, Lin Z, Tan Y, Ma Q, Zhou W, Zhao Y, Xu S.   +8 more
europepmc   +1 more source

IAGRN: An Interleaved-Attention Graph Neural Network for Gene Regulatory Network Inference. [PDF]

Int J Mol Sci
Wang Y, Tian S, Li D.
europepmc   +1 more source

Brick assignments and homogeneously almost self-complementary graphs [PDF]

Journal of Combinatorial Theory Series B, 2009
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost ...
Primoz Potocnik, Mateja Sajna
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Enumeration of Bipartite Self-Complementary Graphs

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Makoto Ueno, Shinsei Tazawa
openaire   +1 more source

Self‐complementary symmetric graphs

Journal of Graph Theory, 1992
AbstractThe class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.
openaire   +1 more source

On regular self‐complementary graphs

Journal of Graph Theory, 1987
AbstractA regular self‐complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.
openaire   +2 more sources

On strongly regular self ‐ complementary graphs

Journal of Graph Theory, 1981
AbstractIt is shown that certain conditions assumed on a regular self‐complementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].
openaire   +1 more source

Transitive tournaments and self‐complementary graphs

Journal of Graph Theory, 2001
AbstractA simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc.
openaire   +1 more source