Results 21 to 30 of about 3,915 (163)
Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs
Discrete Applied Mathematics, 2000 For a graph \(G = (V,E)\) a linear ordering \(\sigma\) of the vertices is called a strong ordering of \(G\) if the following property is fulfilled: if \(ab, ac, bd \in E\), \(a
openaire +1 more source
Molecular Oncology, EarlyView.In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
On the complexity of color-avoiding site and bond percolation
, 2018 The mathematical analysis of robustness and error-tolerance of complex networks has been in the center of research interest. On the other hand, little work has been done when the attack-tolerance of the vertices or edges are not independent but certain ...
A Hackett +23 more
core +1 more source
Implementation of Drug‐Induced Rhabdomyolysis and Acute Kidney Injury in Microphysiological System
Advanced Functional Materials, EarlyView.A modular Muscle–Kidney proximal tubule‐on‐a‐chip integrates 3D skeletal muscle and renal proximal tubule tissues to model drug‐induced rhabdomyolysis and acute kidney injury. The coculture system enables dynamic tissue interaction, functional contraction monitoring, and quantification of nephrotoxicity, revealing drug side effect‐induced metabolic ...
Jaesang Kim +4 more
wiley +1 more source
A characterization of chordal graph without sun and co-rising sun as convex geometry
Theory and Applications of GraphsIn this paper we introduce the notion of $t_3$ \textit{convexity}, a natural restriction of triangle convexity. A \textit{triangle path} is a path allowing just short chords. A triangle path $P$ between two non-adjacent vertices in a graph $G$ is called $
Silvia B. Tondato
doaj +1 more source
Matching and multidimensional matching in chordal and strongly chordal graphs
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dahlhaus, Elias, Karpinski, Marek
openaire +2 more sources
A Degradable Bioinspired Flier with Aerogel‐Based Colorimetric Sensors for Environmental Monitoring
Advanced Science, EarlyView.Biodegradable fliers are developed inspired by Tipuana tipu samaras, integrating cellulose nanocrystal aerogel (CNCa) sensors loaded with natural dyes for pH and ammonia detection. The lightweight, degradable fliers mimic natural morphology and aerodynamics, offering an eco‐friendly, scalable solution for in situ environmental monitoring after passive ...
Gianpaolo Gallo +4 more
wiley +1 more source
MathematicsDomination problems are fundamental problems in graph theory with diverse applications in optimization, network design, and computational complexity.
Chuan-Min Lee
doaj +1 more source
Hamiltonian chordal graphs are not cycle extendible [PDF]
, 2014 In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater.
Lafond, Manuel, Seamone, Ben
core
Two Optimal Strategies for Active Learning of Causal Models from Interventional Data
, 2013 From observational data alone, a causal DAG is only identifiable up to Markov equivalence. Interventional data generally improves identifiability; however, the gain of an intervention strongly depends on the intervention target, that is, the intervened ...
Alain Hauser +24 more
core +1 more source