Results 41 to 50 of about 408 (250)

Intravital Multimodal Imaging of Human Cortical Organoid Transplantation in a Mouse Model of Chronic Stroke

open access: yesAdvanced Science, EarlyView.
A multimodal intravital imaging platform enables longitudinal tracking of human cortical organoids transplanted into chronic stroke lesions. By combining surgical microscopy, MRI, bioluminescence imaging, and two‐photon fluorescence microscopy, the platform captures graft placement, viability dynamics, and cellular‐scale morphology in vivo, offering a ...
Jinghui Wang   +12 more
wiley   +1 more source

Prime Graceful Labeling

open access: yesInternational Journal of Engineering & Technology, 2018
A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection   from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that  gcd ( ( ),  ( )=1 and the induced injective function   from the edges of G to {1, 2, ..., k − 1} defined by  ( ) = |  ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire   +2 more sources

Solid Harmonic Wavelet Bispectrum for Image Analysis

open access: yesAdvanced Science, EarlyView.
The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown   +3 more
wiley   +1 more source

Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs

open access: yesTheory and Applications of Graphs, 2020
In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj   +1 more source

Block-Graceful Designs

open access: yesJournal of Mathematics, 2023
In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj   +1 more source

GRACEFUL LABELING OF HANGING THETA GRAPHS [PDF]

open access: yesInternational Journal of Pure and Apllied Mathematics, 2013
Summary: In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling.
Janakiraman, T. N., Sathiamoorthy, G.
openaire   +1 more source

Cross Kingdom Metabolic Engineering Paradigm Elevating Sustainable Protein Production

open access: yesAdvanced Science, EarlyView.
ABSTRACT Confronting the dual crisis of escalating global protein demand and unsustainable agriculture necessitates transformative solutions. Here, we pioneer evolutionary insights from maize nitrogen optimization via asparagine synthetase (ASNS) to rewire metabolism in Pichia pastoris.
Yuanyuan Du   +4 more
wiley   +1 more source

Graceful Labeling of Posets

open access: yesAnnals of Mathematics and Physics
Abstract The concept of graph labeling was introduced in the mid-1960s by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the `adjunct' operation of two lattices with respect to an adjunct ...
Ashok Bhavale, Dr. DEEPAK SHELKE*
openaire   +2 more sources

On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One

open access: yesJournal of Applied Mathematics, 2016
A graceful labeling of a tree T with n edges is a bijection f:V(T)→{0,1,2,…,n} such that {|f(u)-f(v)|:uv∈E(T)} equal to {1,2,…,n}. A spider graph is a tree with at most one vertex of degree greater than 2. We show that all spider graphs with at most four
A. Panpa, T. Poomsa-ard
doaj   +1 more source

TSPYL5 Promotes Triple‐Negative Breast Cancer Metastasis by Antagonizing USP10‐Mediated PTEN Stabilization to Unleash a ZEB1‐Dependent EMT Program

open access: yesAdvanced Science, EarlyView.
The hyperactivation of PI3K/AKT signaling in PTEN wild‐type triple‐negative breast cancer represents a clinical paradox. We delineate a novel post‐translational regulatory axis wherein the oncogene TSPYL5 competitively antagonizes the deubiquitinase USP10.
Jiaying Shi   +8 more
wiley   +1 more source

Home - About - Disclaimer - Privacy