Results 121 to 130 of about 8,731,938 (294)
On the domination and signed domination numbers of zero-divisor graph
Electronic Journal of Graph Theory and Applications, 2016 Let $R$ be a commutative ring (with 1) and let $Z(R)$ be its set of zero-divisors. The zero-divisor graph $\Gamma(R)$ has vertex set $Z^*(R)=Z(R) \setminus \lbrace0 \rbrace$ and for distinct $x,y \in Z^*(R)$, the vertices $x$ and $y$ are adjacent if and ...
Ebrahim Vatandoost, Fatemeh Ramezani
doaj +1 more source
FEBS Letters, EarlyView.Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante +10 more
wiley +1 more source
Total Domination Multisubdivision Number of a Graph
Discussiones Mathematicae Graph Theory, 2015 The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Avella-Alaminos Diana +3 more
doaj +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
FEBS Letters, EarlyView.Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
Domination Number of Harary Graph [PDF]
, 2023 The domination number of graph  is the smallest cardinality of the domination set of graph G. A subset of a vertex set S of G is called the domination set if every element of  dominates every vertex of G, meaning that every vertex of G that is not an ...
Albab, M Ulul, Zuhri, Zainullah
core
Synergistic perspectives—How single‐molecule biophysics complement biochemical understanding
FEBS Letters, EarlyView.In this review, we discuss how ensemble biochemistry and single‐molecule approaches are complementary, outline commonly used single‐molecule techniques, and illustrate their relevance through two representative case studies: chromatin organization by SMC complexes and pathway choice during DNA double‐strand break repair.
Sara De Bragança +2 more
wiley +1 more source
FEBS Letters, EarlyView.Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source
Perfectly relating the domination, total domination, and paired domination numbers of a graph
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José D. Alvarado +2 more
openaire +3 more sources
Signed total domination number of a graph [PDF]
, 2001 summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
core +1 more source
When the connected domination number is at most the total domination number [PDF]
, 2011 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core +2 more sources