Results 11 to 20 of about 14,359 (120)
Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function
FEBS Open Bio, EarlyView.We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke +4 more
wiley +1 more source
Arthritis Care &Research, EarlyView.Objective Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies.
Anahita Deboo +88 more
wiley +1 more source
Completely independent spanning trees in Eisenstein-Jacobi networks
The Journal of SupercomputingAbstract In this work, we propose construction algorithms to build Completely Independent Spanning Trees (CIST) in EJ networks with time complexity of $O(n)$, where $n$ is the total number of nodes in the network. We present a sequential and a parallel CISTs construction algorithms.
Zaid Hussain +2 more
openaire +1 more source
Innovating Aircraft Repair Processes: The Role of Digitalization in Sustainability
Advanced Engineering Materials, EarlyView.This research explores how digitalization—by storing detailed non‐destructive testing data in structured DICONDE databases and creating a standard data model of the component—innovates aviation maintenance and repair processes. Coupled with a developed state‐based simulation model, it enables data‐driven, sustainable repair strategies that reduce waste,
Johanna Aigner +3 more
wiley +1 more source
Two counterexamples on completely independent spanning trees
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An Algorithm to Construct Completely Independent Spanning Trees in Line Graphs
The Computer Journal, 2021 AbstractIn the past few years, much importance and attention have been attached to completely independent spanning trees (CISTs). Many results, such as edge-disjoint Hamilton cycles, traceability, number of spanning trees, structural properties, topological indices, etc., have been obtained on line graphs, and researchers have applied the line graphs ...
Yifeng Wang +4 more
openaire +1 more source
Fan's condition for completely independent spanning trees
Spanning trees $T_1,T_2, \dots,T_k$ of $G$ are $k$ completely independent spanning trees if, for any two vertices $u,v\in V(G)$, the paths from $u$ to $v$ in these $k$ trees are pairwise edge-disjoint and internal vertex-disjoint. Hasunuma proved that determining whether a graph contains $k$ completely independent spanning trees is NP-complete, even ...
Ma, Jie, Cai, Junqing
openaire +2 more sources
Constructing two completely independent spanning trees in hypercube-variant networks
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kung-Jui Pai, Jou-Ming Chang
openaire +2 more sources
Contributions to Discrete MathematicsLet $T_{1},T_{2},\dots,T_{k}$ be spanning trees of a graph $G$. For any two vertices$u,v$ of $G$, if the paths from $u$ to $v$ in these $k$ trees are pairwise openly disjoint, then we say that $T_{1},T_{2},\dots,T_{k}$ are completely independent spanning trees.
openaire +1 more source
Construction of Four Completely Independent Spanning Trees on Augmented Cubes
, 2017 Let T1, T2,..., Tk be spanning trees in a graph G. If for any pair of vertices {u, v} of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges and common vertices, except the vertices u and v, then T1, T2,..., Tk are called completely independent spanning trees in G. The n-dimensional augmented cube, denoted as AQn, a
Mane, S. A. +2 more
openaire +2 more sources