Results 21 to 30 of about 4,122,423 (255)
New results on induced matchings
The paper concerns graphs \(G=\langle V,E\rangle.\) The induced matching \(M\subseteq E\) contains a subset of edges of \(E\) that no two edges \(e_{i}\) and \(e_{j}\) in \(M \) share a common vertex \(v\in V\) and there is no \(e\in E\) connecting \(e_{i}\) and \(e_{j}.\) So, induced matching is matching that no two edges are connected in \(G\).
Martin Charles Golumbic +1 more
openaire +3 more sources
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Induced matchings in intersection graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Strong edge-colouring and induced matchings [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hervé Hocquard +2 more
openaire +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
On the induced matching problem in hamiltonian bipartite graphs [PDF]
AbstractIn this paper, we study the parameterized complexity of theinduced matchingproblem in hamiltonian bipartite graphs and the inapproximability of the maximum induced matching problem in hamiltonian bipartite graphs. We show that, given a hamiltonian bipartite graph, the induced matching problem is W[1]-hard and cannot be solved in timeno(k){n^{o(
openaire +3 more sources
Diversity and complexity in neural organoids
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
The Maximum Number of Dominating Induced Matchings
AbstractA matching M of a graph G is a dominating induced matching (DIM) of G if every edge of G is either in M or adjacent with exactly one edge in M. We prove sharp upper bounds on the number of DIMs of a graph G and characterize all extremal graphs.
Lin, Min Chih +3 more
openaire +4 more sources
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto +3 more
wiley +1 more source

