Results 121 to 130 of about 390,323 (304)

On the Independence Number of Edge Chromatic Critical Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree △ and independence number α (G), α (G) ≤. It is known that α (G) < |V |. In this paper we improve this bound when △≥ 4.
Pang Shiyou   +3 more
doaj   +1 more source

Degradation mechanism of the von Willebrand factor A2 domain by nattokinase

open access: yesFEBS Letters, EarlyView.
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

New Formulae for the Decycling Number of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A set S of vertices of a graph G is called a decycling set if G−S is acyclic. The minimum order of a decycling set is called the decycling number of G, and denoted by ∇(G). Our results include: (a) For any graph G,, where T is taken over all the spanning
Yang Chao, Ren Han
doaj   +1 more source

An unexpected alternative viologen electron mediator site in tungsten‐containing formate dehydrogenase

open access: yesFEBS Letters, EarlyView.
An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley   +1 more source

Bounds on the Signed 2-Independence Number in Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2013
Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G.
Volkmann Lutz
doaj   +1 more source

Electron transfer between complexes III and IV in S. cerevisiae mitochondrial membranes

open access: yesFEBS Letters, EarlyView.
Mitochondrial oxidative phosphorylation in S. cerevisiae mitoplasts is limited by complex IV catalytic capacity, rather than two‐dimensional cytochrome c diffusion. At physiological cytochrome c : supercomplex ratios at salinity equivalent to that of 20 mm monovalent salt, activity is maximized, indicating that this low ionic strength accurately mimics
Ana Paula Lobez   +2 more
wiley   +1 more source

From mice to humans—divergent strategies for intestinal homeostasis and regeneration

open access: yesFEBS Letters, EarlyView.
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa   +2 more
wiley   +1 more source

The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

open access: yes, 2010
In this paper we characterize the unique graph whose least eigenvalue attains the minimum among all graphs of a fixed order and a given vertex (edge) independence number or vertex (edge) cover number, and get some bounds for the vertex (edge ...
Tan, Ying-Ying, Fan, Yi-Zheng
core   +1 more source

Subgroup intersection graph of finite abelian groups [PDF]

open access: yesTransactions on Combinatorics, 2012
Let G be a finite group with identity e. The subgroup intersection graph Gamma_SI (G) of G isa graph with vertex set G − e and two distinct vertices x and y are adjacent if and only if | i ∩ | | > 1.
T. Tamizh Chelvam, M. Sattanathan
doaj  

Phosphoinositides and inositol phosphates as molecular glues

open access: yesFEBS Letters, EarlyView.
Inositol phosphates (IPs) and phosphoinositides (PIPs) regulate diverse eukaryotic processes. Beyond recruiting signaling proteins or acting as structural cofactors, recent studies suggest they mediate protein–protein interactions as natural molecular glues.
Aleshia Seaton‐Terry   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy