Results 81 to 90 of about 1,017,247 (314)
Advanced Science, EarlyView.Whole‐genome analysis of 1,054 chickens reveals three ancestral sources (NWC, SYA, and SHF) with distinct temporal entry patterns into the Tibetan Plateau. Route‐specific selection scans, calibrated against a demographic null, suggest complementary functional enrichments—vascular homeostasis (NWC), calcium signaling and cardiac adaptation (SYA), and ...
Zongyi Zhao +7 more
wiley +1 more source
Bipartite Unique Neighbour Expanders via Ramanujan Graphs
EntropyWe construct an infinite family of bounded-degree bipartite unique neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may be closer to ...
Ron Asherov, Irit Dinur
doaj +1 more source
Advanced Science, EarlyView.SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio +6 more
wiley +1 more source
Hierarchical Representation Learning for Bipartite Graphs
International Joint Conference on Artificial Intelligence, 2019 Recommender systems on E-Commerce platforms track users' online behaviors and recommend relevant items according to each user’s interests and needs. Bipartite graphs that capture both user/item feature and use-item interactions have been demonstrated to ...
Chong Li +4 more
semanticscholar +1 more source
Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter [PDF]
Discrete Applied Mathematics, 2017 The first multiplicative Zagreb index of a graph G is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the degree of each edge over all edges.
Chunxiang Wang +2 more
semanticscholar +1 more source
The Median Problem on k-Partite Graphs
Discussiones Mathematicae Graph Theory, 2015 In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G.
Pravas Karuvachery, Vijayakumar Ambat
doaj +1 more source
Cubic planar graphs that cannot be drawn on few lines
Journal of Computational Geometry, 2021 For every integer $\ell$, we construct a cubic 3-vertex-connected planar bipartite graph $G$ with $O(\ell^3)$ vertices such that there is no planar straight-line drawing of $G$ whose vertices all lie on $\ell$ lines.
David Eppstein
doaj +1 more source
Domination in bipartite graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jochen Harant, Dieter Rautenbach
openaire +2 more sources
On Turán exponents of bipartite graphs [PDF]
Combinatorics, probability & computing, 2018 A long-standing conjecture of Erdős and Simonovits asserts that for every rational number $r\in (1,2)$ there exists a bipartite graph H such that $\mathrm{ex}(n,H)=\Theta(n^r)$ .
T. Jiang, Jie Ma, Liana Yepremyan
semanticscholar +1 more source
TDP‐43 Aggregation: The Healthy‐Toxic Balance of the Prion‐Like Domain
Advanced Science, EarlyView.TDP‐43 function relies on a delicate balance between reversible phase‐separated states and irreversible aggregation. Under physiological conditions, TDP‐43 forms dynamic droplets and oligomers that support normal cellular functions. In pathological contexts, this balance shifts toward aberrant aggregation, leading to toxic species.
Luca Zangrando +2 more
wiley +1 more source