Results 111 to 120 of about 7,042,445 (296)
Total domination and total domination subdivision number of a graph and its complement
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron +2 more
openaire +2 more sources
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
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +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
Paired and Total Domination on the Queen’s graph
, 2005 Keywords: Queen’s graph, domination, total dominating set, paired dominating set, total domination, paired domination, chess, Queen’s domination problem Paired and Total domination on the Queen’s graph ...
Debra Knisley Ph. D, Asa Burchett
core
Maximal Domination and Maximal Total Domination in Digraphs [PDF]
, 2020 Let D=(V, A) be a digraph. A dominating set S of a digraph D is a maximal dominating set if V -S is not a dominating set of D. The maximal domination number m (D) of D is minimum cardinality of a maximal dominating set of D.
V R Kulli
core
Total Domination in Rooted Product Graphs
, 2020 During the last few decades, domination theory has been one of the most active areas of research within graph theory. Currently, there are more than 4400 published papers on domination and related parameters.
Juan A. Rodríguez-Velázquez +1 more
core +1 more source
Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. There exist infinite families of graphs that are not TI-graphs. We define the TI-augmentation number \(\operatorname{ti}(
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
Structural and biochemical analysis of a B12 superbinder
FEBS Letters, EarlyView.BtuG proteins are vitamin B12 scavengers in Bacteroides thetaiotaomicron, a dominant human gut bacterium. We present crystal structures of three BtuG homologs bound to cobalamin and its precursor cobinamide, revealing picomolar binding affinities, among the highest known for any natural protein.
Jose M. Martinez Felices +3 more
wiley +1 more source
Disjoint dominating and total dominating sets in graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning +3 more
openaire +2 more sources