Results 71 to 80 of about 21,321 (296)
This review examines how cellular behavior is regulated by mechanical cues transmitted through soft biomaterials, from single‐cell mechanosensing to tissue‐level adaptation. It highlights why physiological relevance, rather than model complexity alone, is critical for translational mechanobiology and introduces a scoring framework linking material ...
Mathias Polz +9 more
wiley +1 more source
On the Vertex In-Degrees of Certain Jaco-Type Graphs [PDF]
International audienceThe concepts of linear Jaco graphs and Jaco-type graphs have been introduced as certain types of directed graphs with specifically defined adjacency conditions. The distinct difference between a pure Jaco graph and a Jaco-type graph
Mary, U +4 more
core +1 more source
The Third Leap Zagreb Index for Trees
The third leap Zagreb index is the sum of the products of vertex degrees and second degrees. In this paper, a lower bound on the third leap Zagreb index is established, and the extremal trees achieving this bound are characterized.
Jia-Ming Zhu +2 more
doaj +1 more source
POSS‐PEG‐NHS and GSH cocrosslinked DPAV to prepare a multifunctional anticalcification valve substitute. This modification enhances mechanical properties, hemocompatibility, and re‐endothelialization while promoting anti‐inflammatory M2 macrophage infiltration and reducing calcification.
Yuqing Zhang +10 more
wiley +1 more source
Vertex Degree Weighted Path Indices
Vertex degree weighted path indices P(N)(a, b, ...), for example P(1)(a, b), P(2)(a, b, c), P(3)(a, b, c, d), and P(4)(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|(max) up to 0.999. Mutually optimized combinations of them are even better, R (P(1)..P(4)) is in the worst tested case > 0.9 ...
openaire +5 more sources
Infinite families of non-Cayley vertex-transitive tournaments [PDF]
In this work is proven the existence of non-Cayley vertex-transitive tournaments of order pk, for each prime p⩾3 and k⩾4, and an explicit construction is given.
Mansilla, Sònia P.
core +1 more source
Limit distributions of the number of vertices with given degree in a conditional configuration graph
We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables according to power-law distribution. Node degrees form semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj +1 more source
On the chromatic number of graphs with some restriction of vertex degrees
Graphs, for which the degree of a certain vertex is equal to (d + 1) and the degrees of all other vertices are at most d , d ≥ 3 , were considered. Properties were obtained to color vertices of these graphs in d colors.
S.N. Selezneva
doaj +1 more source
Encoded Cell‐Material Interactions to Reroute Cytokine Signaling for Regenerative Medicine
We present native MATRIX (Material Activated To Regulate Inducible gene eXpression), a co‐engineered material‐cell platform. Surfaces functionalized with antibodies for endogenous soluble ligands (e.g., IL‐1β or IL‐6) capture and immobilize ligands for presentation to a cognate, engineered synthetic Notch receptor, releasing a transcription factor (TF)
Zachary M. Eidman +7 more
wiley +1 more source
Preferential attachment without vertex growth: emergence of the giant component [PDF]
We study the following preferential attachment variant of the classical Erdos-Renyi random graph process. Starting with an empty graph on n vertices, new edges are added one-by-one, and each time an edge is chosen with probability roughly proportional to
Warnke, Lutz, Janson, Svante
core +2 more sources

