Results 91 to 100 of about 520,977 (330)
To dissect how mechanical forces influence intestinal physiology, we developed a stretchable 3D colon‐on‐chip that integrates tunable topography, stiffness and peristalsis‐like motion within a physiologically relevant microenvironment. We showed that stretching is a dominant factor governing epithelial behavior, markedly enhancing proliferation and ...
Moencopi Bernheim‐Dennery +10 more
wiley +1 more source
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke +4 more
doaj +1 more source
AbstractIn this paper perfectness of various products of graphs is considered. The Cartesian product G1 × G2 is perfect iff it has no induced C2n+1 (n ⩾ 2). By considering the various sufficient conditions for the latter condition, perfect Cartesian products are characterized. Similarly perfect tensor products G1 × G2 are characterized and it is proved
Ravindra, G., Parthasarathy, K.R.
openaire +2 more sources
Detecting proteins secreted by a single cell while retaining its viability remains challenging. A particles‐in‐particle (PiPs) system made by co‐encapsulating barcoded microparticles (BMPs) with a single cell inside an alginate hydrogel particle is introduced.
Félix Lussier +10 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
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
A Soft Microrobot for Single‐Cell Transport, Spheroid Assembly, and Dual‐Mode Drug Screening
A soft, untethered hydrogel microrobot enables precise single‐cell delivery, self‐assembly into 3D spheroids, and real‐time thermal actuation. Driven by light‐induced convection and embedded with gold nanorods and temperature sensors, the microrobot guides cells, modulates local microenvironments, and supports drug testing.
Philipp Harder +3 more
wiley +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
COMPUTING THE ANTI-KEKULÉ NUMBER OF CERTAIN NANOTUBES AND NANOCONES
Let G(V,E) be a connected graph. A set M subset of E is called a matching if no two edges in M have a common end-vertex. A matching M in G is perfect if every vertex of G is incident with an edge in M.
Mehar Ali MALIK, Muhammad IMRAN
doaj

