Results 111 to 120 of about 11,106,432 (291)
On independent domination and packing numbers of subcubic graphs
Applied Mathematics and ComputationIn a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of characterizing subcubic graphs that achieve this bound. In this paper, we completely solve the question by proving that exactly four graphs meet this bound.
Xuqing Bai +3 more
openaire +3 more sources
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
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Automorphisms and independent number of single nonzero component graph over a vector space
Open MathematicsIn this paper, we introduce a graph structure, called the single non-zero component graph Γ(V) ${\Gamma}\left(\mathbb{V}\right)$ , on a finite dimensional vector space V $\mathbb{V}$ .
Xi Wentao +3 more
doaj +1 more source
New bound on MIS and MIN-CDS for a unit ball graph
ICT Express, 2017 The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number.
D.A. Mojdeh, M. Ghanbari, M. Ramezani
doaj +1 more source
On upper bounds for the independent transversal domination number
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Brause +4 more
openaire +4 more sources
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
Prospecting the protein design landscape
FEBS Letters, EarlyView.This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona +4 more
wiley +1 more source
THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES [PDF]
Communications of the Korean Mathematical Society, 2003 Summary: We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.
openaire +2 more sources
Artificial molecular machines and motors—Design and control of nanoscale motion
FEBS Letters, EarlyView.Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source