Results 61 to 70 of about 11,026 (283)
Aldosterone‐producing adenomas (APAs) develop via two distinct paths: directly from adrenal zona glomerulosa (zG) cells, or stepwise from zG cells through aldosterone‐producing micronodules (APMs) before progressing to APAs. Advanced single‐cell and spatial analyses identified distinct cell states linked to oxidative stress and cell–cell interactions ...
Zhuolun Sun +7 more
wiley +1 more source
The coalescence of multi-wheel and starlike graphs is DLS [PDF]
The Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum, it means that it can be identified by this spectrum, it is called $DLS ...
Mohammad Hasan Ahangarani Farahani +1 more
doaj +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
Graph Complexes with Loops and Wheels [PDF]
Motivated by the problem of deformation quantization we introduce and study directed graph complexes with oriented loops and wheels – differential graded (dg) wheeled props. We develop a new technique for computing cohomology groups of such graph complexes and apply it to several concrete examples such as the wheeled completion of the operad of ...
openaire +2 more sources
This study harnesses hydrodynamic flows to generate, confine and stimulate stem cell spheroids, enabling the large‐scale production of extracellular vesicles (EVs). This innovative method not only streamlines spheroid formation and subsequent EV release in a single, integrated process, but also ensures the generation of EVs with enhanced biological ...
Solène Lenoir +7 more
wiley +1 more source
Complexity of Join and Corona graphs and Chebyshev polynomials
Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj +1 more source
The n-Wiener Polynomials of the Cartesian Product of a Complete Graph with some Special Graphs [PDF]
The n-Wiener polynomials of the Cartesian products of a complete graph Kt with another complete graph Kr, a star graph Sr, a complete bipartite graph Kr,s, a wheel Wr, and a path graph Pr are obtained in this paper.
Ali Ali, Haveen Ahmed
doaj +1 more source
Edge-Magic Labelings of Wheel Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Endocytic Control of Cell‐Autonomous and Non‐Cell‐Autonomous Functions of p53
NUMB Ex3‐containing isoforms localize to the plasma membrane, where they recruit p53 through SNX9 and direct it to multivesicular bodies and exosomes. Exported p53 is taken up by neighboring cells and activates nuclear programs, revealing an intercellular, exosome‐based pathway that might help establish a tumor‐suppressive microenvironment.
Roberta Cacciatore +20 more
wiley +1 more source
w-Wiener Polynomials for Width Distance of Some Special Graphs [PDF]
Let G be a k0-connected graph ,and let ,,be the w- width, distance between the two vertices u,v in G. The w-Wiener polynomial of the width distance of G is defined by: Ww(G;x) is obtained in this paper for some special graphs G ...
Ali Ali, Asma Aziz
doaj +1 more source

