Results 71 to 80 of about 8,369 (289)
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
FEBS 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
Triangle-free graphs with large independent domination number [PDF]
, 2010 Let G be a simple graph of order n and minimum degree δ. The independent domination number i(G) is defined as the minimum cardinality of an independent dominating set of G. We prove the following conjecture due to Haviland [J.
Chen, Xue-gang +2 more
core +1 more source
Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers [PDF]
Transactions on Combinatorics, 2015 A 2-emph{rainbow dominating function} (2RDF) on a graph $G=(V, E)$ is a function $f$ from the vertex set $V$ to the set of all subsets of the set ${1,2}$ such that for any vertex $vin V$ with $f(v)=emptyset$ the condition $bigcup_{uin N(v)}f(u)={1,2}$
J. Amjadi +3 more
doaj
Graph polynomials for a class of DI-pathological graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple graph. A dominating set is a set such that the closed neighborhood of is the entire vertex set. An independence set of a graph is a subset of vertices that are pairwise non-adjacent.
James M. Hammer, Joshua Harrington
doaj +1 more source
FEBS 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
Outer-independent k-rainbow domination
Journal of Taibah University for Science, 2019 An outer-independent k-rainbow dominating function of a graph G is a function f from $V(G) $ to the set of all subsets of $\{1,2,\ldots ,k\} $ such that both the following hold: (i) $\{1,\ldots ,k\}=\bigcup _{u\in N(v)} f(u) $ whenever v is a vertex with
Qiong Kang +4 more
doaj +1 more source
A characterization of trees with equal 2-domination and 2-independence numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.
Christoph Brause +2 more
doaj +1 more source
The ratio of domination and independent domination numbers on trees
, 2016 Accepted by Congressus Numernatium(2016)
Wang, Shaohui, Wei, Bing
openaire +3 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
On average lower independence and domination numbers in graphs
Discrete Mathematics, 2005 Let \(V(G)\) be the vertex set of a graph \(G\). The lower independence number \(i_{av}(G)\) of a graph \(G\) is defined as \(\frac{1}{| V(G)| }\sum_{v\in V(G)}i_v(G)\), and the average lower domination number \({\gamma}_{av}(G)\) is defined as \(\frac{1}{| V(G)| }\sum_{v\in V(G)}{\gamma}_v(G)\), where \(i_v(G)\) is the minimum cardinality of a maximal
Blidia, Mostafa +2 more
openaire +2 more sources