Results 21 to 30 of about 2,449,773 (154)

Bipartite graphs and quasipositive surfaces [PDF]

, 2013
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.
SEBASTIAN BAADER, Baader, Sebastian
core   +2 more sources

Topological network entanglement as order parameter for the emergence of geometry

New Journal of Physics, 2017
We show that, in discrete models of quantum gravity, emergent geometric space can be viewed as the entanglement pattern in a mixed quantum state of the ‘universe’, characterized by a universal topological network entanglement.
M Cristina Diamantini, Carlo A Trugenberger   +1 more
doaj   +1 more source

PRISM, a Bidirectional NMR Foundation Model: From Peak List to Structure and Back

Angewandte Chemie, EarlyView.
Structure elucidation from NMR can consume an expert for hours or even days. PRISM addresses this with a bidirectional transformer trained on 1.19 M real experimental spectra: it translates 1H and 13C peak lists into structures with 60.1% stereo‐aware top‐1 accuracy (72.5% stereo‐unaware), and, working in reverse, predicts spectra back from structures,
Ajnabiul Hoque, Frank Glorius
wiley   +2 more sources

Packing bipartite graphs with covers of complete bipartite graphs [PDF]

, 2014
International audiencePacking bipartite graphs with covers of complete bipartite ...
Paulusma, D., Chalopin, Jérémie, Chalopin, J., Paulusma, Daniël   +3 more
core   +1 more source

Packing Bipartite Graphs with Covers of Complete Bipartite Graphs [PDF]

, 2010
International audiencePacking Bipartite Graphs with Covers of Complete Bipartite ...
Paulusma, D., Chalopin, Jérémie, Chalopin, J., Paulusma, Daniël, Jérémie Chalopin, Daniël Paulusma   +5 more
core   +1 more source

An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs

, 2020
The problem of computing a maximum weight matching in a bipartite graph is one of the fundamental algorithmic problems that has played an important role in the development of combinatorial optimization and algorithmics. Let G_{w,σ} is a collection of all
Shibsankar Das, null null
core   +1 more source

Genetic dissection of human ABCE1 in yeast reveals separable requirements for ribosome recycling and suppression of aberrant reinitiation

FEBS Open Bio, EarlyView.
Human ABCE1 cannot functionally replace its yeast ortholog. Yeast–human chimera analysis identified NBD1 as a major interspecies barrier. Genetic screening yielded hABCE1 revertants that rescue yeast viability but fail to suppress aberrant translation reinitiation in the 3′ UTR.
Eriko Nakata, Yuxin Li, Kei Endo, Koichi Ito   +3 more
wiley   +1 more source

Regular embeddings of complete bipartite maps: classification and enumeration

The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined.
Jones, Gareth
core   +2 more sources

𝕮-inverse of graphs and mixed graphs

Open Mathematics
This article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph GG with adjacency matrix A(G)A\left(G), the inverse graph G−1{G}^{-1} is defined such that its adjacency matrix is similar
Alomari Omar, Abudayah Mohammad, Ghanem Manal   +2 more
doaj   +1 more source

On bipartite graphs with complete bipartite star complements

, 2014
Let G be a bipartite graph with μ as an eigenvalue of multiplicity k>1k>1. We show that if G has Kr,sKr,s(1≤r≤s)(1≤r≤s) as a star complement for μ then k≤s-1k≤s-1; moreover if μ is non-main then k≤s-2k≤s-2 for large enough s .
Rowlinson, Peter
core   +1 more source