Results 81 to 90 of about 59,692 (266)
A 3D Human Neuron‐on‐Chip Platform to Monitor Neuronal Injury Responses
This study presents a novel 3D Neuron‐on‐Chip model that can maintain human PSC‐derived excitatory prefrontal cortex neurons in 3D hydrogels and can be used to monitor neuronal injury responses over time. Results show injury‐induced acute neuronal excitotoxicity, declining neuronal connectivity, and the activation of a neurodegenerative, SASP‐like ...
Ruiping Tang +16 more
wiley +1 more source
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source
On connected components and perfect codes of proper order graphs of finite groups [PDF]
Let G be a finite group with the identity element e. The proper order graph of G, denoted by â* (G), is an undirected graph with a vertex set G \ {e}, where two distinct vertices x and y are adjacent whenever o(x) | o(y) or o(y) | o(x), where o(x) and ...
Huani Li, Shixun Lin, Xuanlong Ma
doaj +1 more source
Engineered red blood cell‐derived extracellular vesicles (eRBCEVs) are synthesized via controlled microfluidic assembly from native RBC lipids, enabling tunable encapsulation of proteins, nucleic acids, nanoparticles, and viral vectors. The platform demonstrates reproducible nanoscale architecture, preserved membrane composition, and functional cargo ...
Chiranth K. Nagaraj +23 more
wiley +1 more source
Distance perfectness of graphs
The author introduces a new generalization of perfect graphs. It turns out that the analogue of the weak perfect graph theorem is not true for this generalization. A subset \(Q\) of the vertex set \(V\) of a graph \(G\) is a \(k\)-distance clique in \(G\) if \(d_G(x,y)\leq k\) for any \(x,y\in Q\) and \(\langle Q\rangle_G\), the subgraph of \(G ...
openaire +1 more source
Gonzalez Martinez and collaborators develop a strategy to formulate high performance GelMA‐based bioinks with low solids contents. The resulting bioinks enable 3D bioprinting at 37 °C of high‐fidelity structures with tunable mechanical properties that support high cell viability and function.
David A. González‐Martínez +8 more
wiley +1 more source
Perfection thickness of graphs
For a graph \(G\), let \(f(G)\) be the least number of perfect subgraphs of \(G\) whose union is \(G\). Let \(f(n)= \max\{f(G):|V(G)|= n\}\). Improving results of Zs. Tuza, the authors prove that \[ \textstyle{{1\over 2}}(\log n-\log\log n- O(1))\leq f(n)\leq \lceil\log n\rceil, \] where \(\log\) denotes the base-2 logarithm.
Hirotsugu Asari +3 more
openaire +2 more sources
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
First-order logic with metric betweenness – the case of non-definability of some graph classes
The metric betweenness of a connected graph and arbitrary graphs is FO definable. Moreover, several interesting classes of graphs with strong distance properties are shown to be FO definable using metric betweenness.
Jeny Jacob, Manoj Changat
doaj +1 more source
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source

