Results 151 to 160 of about 34,901 (303)
Classifying Higher Rank Toeplitz Operators. [PDF]
To a higher rank directed graph (Λ, d), in the sense of Kumjian and Pask, 2000, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed.
Power, S.C.
core
FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH
<p>For any vertex in a connected graph of order a set is called a -<em>triangle free detour set</em> of if every vertex of lies on a triangle free detour for some vertex in ...
S. Sethu Ramalingam *1, I. Keerthi Asir2 and S. Athisayanathan 3
core +1 more source
This perspective proposes a cohesive machine learning strategy to decode microplastic aging. It advocates for Federated Learning to dismantle global data silos and introduces the TRACE framework (TRansport, Aging, Corona, Ecotoxicity). By integrating physics‐informed modeling with causal discovery, this approach bridges the laboratory‐field gap to ...
Yaping Lyu +6 more
wiley +1 more source
Directed triangles in directed graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A Conserved DT2‐bZIP66‐NF‐YC4 Regulatory Module Confers Drought Tolerance in Rice and Arabidopsis
This study identifies a conserved tripartiteDT2–bZIP66–NF‐YC4 transcriptional module that enhances rice drought tolerance by activating stress‐responsive genes. This regulatory complex is functionally conserved across cereals and Arabidopsis, providing promising targets for engineering drought‐resilient crops. ABSTRACT Drought stress severely restricts
Jun Shen +18 more
wiley +1 more source
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors
Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n).
Krawczyk, Tomasz +5 more
core +1 more source
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
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Factoring the cartesian product of a cubic graph and a triangle
Kotzig asked: does the cartesian product of a bridgeless cubic graph with a triangle always have a one-factorization? We answer this in the affirmative.
Wallis, W.D., Horton, J.D.
core +1 more source
Hijacked and educated by HNSCC cells, HLA‐DR+ Schwann cells lost their normal neural‐related functions but acquired immunoregulatory phenotypes to promote CD4+ T cells transform into Tregs. HLA‐DR+ Schwann cells induced a macrophage subpopulation, Il1β.
Xiaoyan Meng +7 more
wiley +1 more source

