Results 241 to 250 of about 27,298 (312)

Functionally complementary bacterial inoculant coordinates arbuscular mycorrhizal fungi to improve Angelica sinensis root yield and quality

iMetaOmics, Volume 3, Issue 2, June 2026.
Comprehensive understanding of how diverse PGPR strains enhance the rhizosphere microenvironment remains a considerable challenge. Here, we provide experimental evidence that a functionally synergistic composite microbial formulation can markedly enhance growth performance and improve the quality attributes in Angelica sinensis.
Zongyu Zhang, Yun Wang, Jiecai Zhao, Gaofeng Chen, Andéole Niyongabo Turatsinze, Liang Yue, Yuan Tian, Xiaofan Xie, Ailing Ye, Meilan Zhang, Lingling Wu, Zengxiang Guo, Yubao Zhang, Ruoyu Wang   +13 more
wiley   +1 more source

Cognitive architecture and behavioral model based on social evidence and resource constraints. [PDF]

Brain Inform
Kolonin A.
europepmc   +1 more source

Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs

Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.
ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han, Hajo Broersma, Shenggui Zhang, Yandong Bai   +3 more
wiley   +1 more source

scHilda: Hierarchical Integration of LLM with KG database for single cell type annotation. [PDF]

PLoS Comput Biol
Li Y, Sun Y, Geng A, Xu J, Meng Y, Cui F, Wei L, Zou Q, Li X, Zhang Z.   +9 more
europepmc   +1 more source

Domination in 4‐Regular Graphs With No Induced 4‐Cycles

Journal of Graph Theory, Volume 112, Issue 2, Page 62-95, June 2026.
ABSTRACT A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S. The domination number of G, denoted by γ ( G ), is the minimum cardinality of a dominating set in G. The 1 3‐conjecture for domination in 4‐regular graphs states that if G is a 4‐regular graph of order n, then γ ( G ) ≤ 1 3 n.
Michael A. Henning, Anders Yeo
wiley   +1 more source

Systematic discovery of disease-modifying targets by prediction from knowledge graph-based AI model and experimental validation: Parkinson's disease case. [PDF]

Comput Struct Biotechnol J
So M, Park SJ, Kim D, Han S, Koo HJ, Kim T, Shin MG, Lee EJ.   +7 more
europepmc   +1 more source

Another Proof of the Generalized Tutte—Berge Formula for f‐Bounded Subgraphs

Journal of Graph Theory, Volume 112, Issue 2, Page 145-150, June 2026.
ABSTRACT Given a nonnegative integer weight f ( v ) for each vertex v in a multigraph G, an f‐bounded subgraph of G is a multigraph H contained in G such that d H ( v ) ≤ f ( v ) for all v ∈ V ( G ). Using Tutte's f‐Factor Theorem, we give a new proof of the min–max relation for the maximum size of an f‐bounded subgraph of G. When f ( v ) = 1 for all v,
Zishen Qu, Douglas B. West
wiley   +1 more source

A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures. [PDF]

Sci Rep
Jaisankar D, Ramalingam S, Zegeye GB.
europepmc   +1 more source

The Independence Ratio of 4‐Cycle‐Free Planar Graphs

Journal of Graph Theory, Volume 112, Issue 2, Page 116-127, June 2026.
ABSTRACT We prove that every n‐vertex planar graph G with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε for ε = 1 ∕ 30. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no adjacent triangles and no triangle sharing an edge with a 5‐cycle.
Tom Kelly, Sid Kolichala, Caleb McFarland, Jatong Su   +3 more
wiley   +1 more source