Results 51 to 60 of about 96,628 (243)
Advanced Science, EarlyView.A deep learning framework called MolVisGNN is proposed to fuse 3D molecular visual information of drugs with multi‐source features, which proves the importance of 3D molecular visual information of drugs and the advancedness of this model in the field of drug discovery, and provides a reference for how to more comprehensively express small molecule ...
Zimai Zhang +9 more
wiley +1 more source
Inverses of Bipartite Graphs [PDF]
Combinatorica, 2017 Let $G$ be a bipartite graph and its adjacency matrix $\mathbb A$. If $G$ has a unique perfect matching, then $\mathbb A$ has an inverse $\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph. The inverses of bipartite graphs with unique perfect matchings have a strong connection to M bius functions of ...
Dong Ye, Yujun Yang
openaire +4 more sources
Annals of Neurology, EarlyView.Objective Mutations in TARDBP (encoding TDP‐43) are associated with the neurodegenerative disease amyotrophic lateral sclerosis (ALS) and include familial missense mutations where there are a lack of models and mechanisms examining how they are pathogenic.
Ziyaan A. Harji +10 more
wiley +1 more source
FLEET: Butterfly Estimation from a Bipartite Graph Stream
, 2019 We consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represents a connection between entities in two different partitions. We present a
Bar-Yossef R. Kumar Z. +10 more
core +1 more source
Bipartite dimensions and bipartite degrees of graphs
Discrete Mathematics, 1996 Let \(G=(V,E)\) be an undirected graph with finite nonempty vertex set \(V\) and irreflexive edge set \(E\). The irreflexive complement of \(G\) is denoted by \(G^c=(V,E^c)\) with \(E^c=\{\{u,v\}:u, v\in V, u\neq v, \{u,v\}\not\in E\}\). A cover of a graph \(G\) is a family of complete bipartite subgraphs of \(G\) whose edges cover the edges of \(G ...
Peter C. Fishburn, Peter L. Hammer
openaire +3 more sources
The Anatomical Record, EarlyView.Examples from the graphic library depicting morphologies of interparietal bones, ossicles at lambda, mendosal sutures, and intrasutural ossicles. Abstract Due to its complex ossification during development, the superior region of the human occipital bone is a frequent site of supernumerary bones known as interparietal bones.
Melissa D. Clarkson +4 more
wiley +1 more source
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
Bipartite graphs that are not circle graphs [PDF]
Annales de l’institut Fourier, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Asian Journal of Control, EarlyView.Abstract This paper focuses on the issue of adaptive event‐triggered containment control for Markov jump multi‐agent systems characterized by hidden Markov jump parameters. The central objective is to design an output‐feedback controller for the Markov jump multi‐agent system by using an adaptive event‐triggered technique that not only ensures the ...
Parivallal Arumugam +3 more
wiley +1 more source
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source