Results 81 to 90 of about 8,731,938 (294)
On a Vizing-type Integer Domination Conjecture
Theory and Applications of Graphs, 2020 Given a simple graph G, a dominating set in G is a set of vertices S such that every vertex not in S has a neighbor in S. Denote the domination number, which is the size of any minimum dominating set of G, by γ(G). For any integer k ≥ 1, a function f : V
Elliot Krop, Randy Davila
doaj +1 more source
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
A note on domination and independence-domination numbers of graphs
Ars Mathematica Contemporanea, 2012 Vizing's conjecture is true for graphs G satisfying γ i ( G ) = γ ( G ), where γ ( G ) is the domination number of a graph G and γ i ( G ) is the independence-domination number of G , that is, the maximum, over all independent sets I in G , of the minimum number of vertices needed to dominate I . The equality γ i ( G ) = γ (
openaire +4 more sources
, 2018 This thesis comprises the results of five research papers on domination and zero forcing. In "Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence" (Gentner, Henning, Rautenbach, 2016) and "Smallest Domination
Gentner, Michael
core +1 more source
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
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
Domination numbers and homology
Journal of Combinatorial Theory, Series A, 2003 Certain homological properties of the independence complex of a graph, which is a simplicial complex on the vertex set of the graph whose simplices are all independent subsets of the vertex set, are studied, as well as their connection with domination numbers. As application Hall-type theorems for colored independent sets are proved.
openaire +3 more sources
Domination parameters: Roman domination number
, 2022 Tezin 1. bölümünde, baskınlık sayısı ve Roman baskınlık sayısı tanımları verilerek, bu kavramlar günlük yaşamdan örnekler ile açıklanmıştır. Ardından Roman baskınlık sayısı için literatürde yer alan bazı sonuçlar verilmiştir. Tezin 2.
Zaim, Nurdan
core
Perfect secure domination in graphs [PDF]
Categories and General Algebraic Structures with Applications, 2017 Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi +3 more
doaj
Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph
Brazilian Archives of Biology and Technology, 2017 In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj +1 more source