Results 61 to 70 of about 6,714 (280)
A new cerebrocortical organoid model using isogenic hiPSCs with familial Alzheimer's mutations recapitulates key AD features, including amyloid‐beta and phospho‐Tau aggregation, neuronal hyperexcitability, and synapse loss. Single‐cell RNA‐seq reveals aberrant pathways in excitatory and inhibitory neurons.
Sergio R. Labra +23 more
wiley +1 more source
Graceful Labeling Algorithms and Complexity – a Survey [PDF]
Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful labeling. Aldred and McKay and others have used computer programs to show that trees of order up to 35 are graceful ...
Arumugam, S. (S), Bagga, J. (Jay)
core
Graceful Labeling For bipartite graceful Graphs and related Graphs
The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in this paper.
Liu, Chunfeng +2 more
openaire +2 more sources
Linearizing and Forecasting: A Reservoir Computing Route to Digital Twins of the Brain
A new approach uses simple neural networks to create digital twins of brain activity, capturing how different patterns unfold over time. The method generates and recovers key dynamics even from noisy data. When applied to fMRI, it predicts brain signals and reveals distinctive activity patterns across regions and individuals, opening possibilities for ...
Gabriele Di Antonio +3 more
wiley +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Solid Harmonic Wavelet Bispectrum for Image Analysis
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
A Study on Integer Additive Set-Graceful Graphs [PDF]
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\rightarrow \mathcal{P}(X)-\{\emptyset\}$ defined by $f^
Germina, K. A., Sudev, N. K.
core
Topological Integer Additive Set-Sequential Graphs
Let $\mathbb{N}_0$ denote the set of all non-negative integers and $X$ be any non-empty subset of $\mathbb{N}_0$. Denote the power set of $X$ by $\mathcal{P}(X)$. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $
Augustine, Germina +2 more
core +2 more sources
This study repurposes mitochondrial DNA mutations as endogenous barcodes for lineage tracing in human pluripotent stem cell‐derived organoids. Integrated with transcriptomic and spatial data, it reveals NOTCH‐mediated stromal‐progenitor crosstalk orchestrates clonal dynamics and spatial zonation during early hematopoietic development, offering a non ...
Yan Xue +17 more
wiley +1 more source
Equitable Labelings of Caterpillar Graphs [PDF]
The Graceful Tree Conjecture in graph theory has been open for almost half a century. The conjecture states that the vertices of any tree can be labeled with distinct integers between 0 and the number of edges of the tree in a way that the edges can be ...
Burek, Mark +2 more
core +2 more sources

