Results 111 to 120 of about 5,748 (282)
Strong rainbow connection numbers of toroidal meshes
, 2018 In 2011, Li et al. [The (strong) rainbow connection numbers of Cayley graphs on Abelian groups, Comput. Math. Appl. 62(11) (2011) 4082–4088] obtained an upper bound of the strong rainbow connection number of an [Formula: see text]-dimensional undirected ...
Yulong Wei, Min Xu, Kaishun Wang
core +1 more source
The FEBS Journal, EarlyView.Investigated mutations in transthyretin (TTR) disrupt the F87‐centered hydrophobic core that stabilizes its tetrameric structure. The mild I107V mutation weakens inter‐chain packing, while H88R fully abolishes tetramer formation, yielding a monomeric, aggregation‐prone form. Structural, biophysical, and computational analyses reveal that both mutations
István L. Bódy +7 more
wiley +1 more source
Mechanistic insights into HapC: A key enzyme in prodiginine biosynthesis in Hahella chejuensis
The FEBS Journal, EarlyView.HapC catalyzes prodiginine biosynthesis through coordinated movements of its ATP‐binding, substrate‐binding, and catalytic‐swivel domains. The enzyme shows tolerance toward short‐chain MAP analogs, and docking analyses reveal key residues and structural features underlying its substrate flexibility.
Yueh‐Te Chan +10 more
wiley +1 more source
Energetics of the Citric Acid Cycle in the Deep Biosphere
Geophysical Monograph Series, Page 303-327., 2020 This book is Open Access. A digital copy can be downloaded for free from Wiley Online Library.
Explores the behavior of carbon in minerals, melts, and fluids under extreme conditions
Carbon trapped in diamonds and carbonate-bearing rocks in subduction zones are examples of the continuing exchange of substantial carbon ...
Peter A. Canovas III, Everett L. Shock
wiley +1 more source
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
BarekengLet be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that .
Ratnaning Palupi, A. N. M. Salman
doaj +1 more source
Rainbow Connectivity: Hardness and Tractability.
, 2011 A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of ...
Prabhanjan Ananth +2 more
openaire +3 more sources
The FEBS Journal, EarlyView.Evolutionary and mechanistic divergence in the Hsp70–Hsp110 chaperone system. Prokaryotic Hsp70s probably diversified into multiple orthologues that cooperated with co‐chaperones such as JDPs and NEF, forming increasingly complex proteostasis networks.
Pierre Goloubinoff +2 more
wiley +1 more source
Rainbow Disconnection in Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G be a nontrivial connected, edge-colored graph. An edge-cut R of G is called a rainbow cut if no two edges in R are colored the same. An edge-coloring of G is a rainbow disconnection coloring if for every two distinct vertices u and v of G, there ...
Chartrand Gary +4 more
doaj +1 more source
The FEBS Journal, EarlyView.Xylan, the second most abundant plant cell wall polysaccharide, is degraded by β‐xylanases and β‐xylosidases. Here, we present the 2.65 Å cryo‐EM structure of Enterobacter cloacae β‐xylosidase (EcXyl43, GH43) and the 2.4 Å X‐ray structure of its inactive F507A mutant.
Lorenzo Briganti +8 more
wiley +1 more source
Rainbow Connection Number Pada Operasi Graf
, 2014 An edge-colouring of a graph $G$ is rainbow connected if there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color.
Yulianti S, Arnasyitha, Dafik, Dafik
core