Results 71 to 80 of about 235 (177)
Advanced Science, EarlyView.A Transformer‐based AI framework, DLINP, screens millions of compounds to identify Co68, a cobalt‐pincer organometallic complex that biases TLR4‐MD2 signaling toward antitumor interferon activation while suppressing inflammatory toxicity through an early TLR4‐SYK‐STAT1 axis.
Xuefei Guo +10 more
wiley +1 more source
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj +1 more source
Discrete Mathematics, 2003 This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord.'' One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs.
openaire +1 more source
On b-perfect Chordal Graphs [PDF]
Graphs and Combinatorics, 2009 The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
Maffray, Frédéric, Mechebbek, Meriem
openaire +3 more sources
Advanced Science, EarlyView.The present study demonstrated that PFOA and HFPO‐TA exposure suppressed CDK4, disrupted MERCs and impaired PINK1/Parkin‐mediated mitophagy, thereby accelerating cardiac senescence, whereas CAG effectively reversed these pathological changes in vitro. Our findings identify CDK4 as a critical regulator bridging mitophagy defects and cardiac senescence ...
Nuo‐Wa Li +6 more
wiley +1 more source
Discrete Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +1 more source
Advanced Science, EarlyView.(i) Aging impairs peripheral nerve regeneration via its dual ferroptosis‐mediated pathologies in senescent schwann cells. (ii) The composite nerve conduit is a symbiosis niche integrating microenvironment‐responsive nanoparticles (Ga‐PTAs) and maxillofacial‐derived mesenchymal stem cells (Mmscs).
Ning Zhan +12 more
wiley +1 more source
Advanced Science, EarlyView.In an invasive beetle–fungus complex, the mutualist Leptographium procerum induces host HSP83 and modulates Toll‐dependent antifungal immunity. HSP83 mediates two‐tiered control by associating with selected fungal recognition receptors and restraining Dorsal‐driven antimicrobial peptide transcription.
Qingtai Yang +8 more
wiley +1 more source
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
Chordal Completions of Planar Graphs
Journal of Combinatorial Theory, Series B, 1994 A graph is chordal if there are no induced cycles of length 4 or more. A chordal completion of a graph is formed by adding edges until the resulting graph is chordal. What is the minimal number of edges in a chordal completion? The authors answer this question for the class of planar graphs: every planar graph on \(n\) vertices has a chordal completion
Fan R. K. Chung, David Mumford
openaire +2 more sources