Results 111 to 120 of about 187,749 (326)
Chi-boundedness of graph classes excluding wheel vertex-minors [PDF]
, 2018 A class of graphs is \(\chi\)-bounded if there exists a function \(f:\mathbb{N}→\mathbb{N}\) such that for every graph \(G\) in the class and every induced subgraph \(H\) of \(G\), if \(H\) has no clique of size \(q+1\), then the chromatic number of \(H\)
Oum, Sang-il
core
On a class of metrics related to graph layout problems [PDF]
, 2010 We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1.
Theis, D O +13 more
core +1 more source
CauFinder: Steering Cell‐State and Phenotype Transitions by Causal Disentanglement Learning
Advanced Science, EarlyView.CauFinder combines causal disentanglement modeling and network control to prioritize causal drivers of cell‐state transitions from observational transcriptomic data. The framework separates transition‐relevant signals from spurious associations, nominates intervention targets across biological and disease contexts, and identifies DAAM1 as an actionable
Chengming Zhang +11 more
wiley +1 more source
Vertex-antimagic total labelings of graphs [PDF]
, 2003 In this paper we introduce a new type of graph labeling for a graph G(V;E) called an (a; d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V| + |E| and calculate the sum of labels
Miller, M. +5 more
core
Physics‐Informed Neural Network‐Enabled Forward Prediction and Inverse Design of Ring Origami
Advanced Science, EarlyView.This work presents a KRT‐PINN framework that integrates Kirchhoff rod theory with physics‐informed neural networks for the forward prediction and inverse design of ring origami consisting of closed‐loop rods. The framework predicts stable states of segmented rings with prescribed natural‐curvature profiles and determines the natural‐curvature profiles ...
Luyuan Ning +3 more
wiley +1 more source
“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis
The Scientific World Journal, 2013 Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods.
Qin Wu +3 more
doaj +1 more source
Vertex-to-vertex pursuit in a graph [PDF]
, 1983 A graph G is given and two players, a cop and a robber, play the following game: the cop chooses a vertex, then the robber chooses a vertex, then the players move alternately beginning with the cop.
Winkler, Peter, Nowakowski, Richard
core +1 more source
Advanced Science, EarlyView.CHCHD10 loss in Alzheimer's disease is associated with mitochondrial dysfunction, epigenomic disruption, and tau pathology. Restoration of CHCHD10 shifts DNA methylation toward a non‐disease state and reduces tau and amyloid pathology, with KATNAL2 acting as a downstream effector.
Teresa M. Thomas +13 more
wiley +1 more source
Every 3-connected, locally connected, claw-free graph is Hamilton-connected [PDF]
, 1996 A graph G is locally connected if the subgraph induced by the neighbourhood of each vertex is connected. We prove that a locally connected graph G of order p ≥ 4, containing no induced subgraph isomorphic to K1,3, is Hamilton-connected if and only if G ...
Asratian, Armen,, Asratian, Armen
core +1 more source
Molecular and Cellular Hallmarks of Age‐Related Vestibular Hair Cell Degeneration
Advanced Science, EarlyView.This study utilizes single‐cell RNA‐seq transcriptomes, advanced imaging, and electrophysiology to examine universal and cell‐type‐specific aging signatures of vestibular hair cells. The study shows that impaired hair bundle function is a key driver of age‐related vestibular dysfunction.
Samadhi Kulasooriya +10 more
wiley +1 more source