Results 121 to 130 of about 1,312,788 (294)
Pragmatic Graph Rewriting Modifications [PDF]
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source
GelMA‐based 3D spheroids recapitulate transcriptomic and functional hallmarks of myeloid sarcoma
GelMA 5% hydrogels support the formation of myeloid leukemia spheroids that recapitulate MS‐specific features, including G1 arrest, apoptosis, and ECM‐driven transcriptomic reprogramming. The 3D model mimicked soft‐tissue‐like stiffness and oxygen conditions, and transcriptomic convergence with primary MS samples confirmed its utility as a preclinical ...
Nicolas Germain +11 more
wiley +1 more source
Bounds for the Laplacian spectral radius of graphs
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph.
Kamal Lochan Patra, Binod Kumar Sahoo
doaj +1 more source
This pilot study investigates the potential of Generative AI to provide formative feedback to students. ChatGPT was prompted to provide feedback on Year 1 Bioscience essays, which were evaluated against established good feedback practices. GenAI‐authored feedback had useful elements, but was limited in scope. GenAI may have potential to provide instant,
Annabel Court +3 more
wiley +1 more source
A STUDY ON HARMONIOUS COLORING OF SNAKE DERIVED ARCHITECTURE [PDF]
There are only few graphs which gives the precise value of the harmonious chromatic number. There are only few results concerning about this problem. We give the precise value of harmonious chromatic number of central graph of snake derived architecture.
FRANKLIN THAMIL SELVI M. S., AMUTHA A.
doaj
Super (a, d)-H-antimagic labeling of subdivided graphs
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G isomorphic to H. A graph G admitting an H-covering is called an (a, d)-H-antimagic if there exists a bijective function f : V(G) ∪ E(G) → {1, 2, …, |V(G)| + |
Taimur Amir +4 more
doaj +1 more source
RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease
ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu +21 more
wiley +1 more source
Concrete Graph Covering Projections
A graph covering projection is a local graph homeomorphism. Certain partitions of the vertex set of the preimage graph induce a notion of ''concreteness''.
Hofmeister, Michael
core
Arterial Spin‐Labeling MRI at the Cortical‐CSF Interface: A Novel Biomarker in Alzheimer Disease
ABSTRACT Background/Objective Arterial spin‐labeling (ASL) MRI can measure perfusion signal adjacent to CSF spaces and may provide information regarding CSF‐adjacent water transport physiology. We developed an automated pipeline to extract cortical‐CSF interface (IF) perfusion for comparison between Alzheimer disease (AD) and cognitively normal ...
Mona Asghariahmadabad +22 more
wiley +1 more source
The Bin-Covering Technique for Thresholding Random Geometric
We study the emerging phenomenon of ad hoc, sensorbased communication networks. The communication is modeled by the random geometric graph model G(n, r, ℓ) where n points randomly placed within [0, ℓ] d form the nodes, and any two nodes that correspond ...
Graph Properties
core

