Results 51 to 60 of about 954,754 (291)
Spanning 3-Ended Trees in Almost Claw-Free Graphs
Discrete Dynamics in Nature and Society, 2015 We prove that if G is a k-connected (k≥2) almost claw-free graph of order n and σk+3(G)≥n+2k-2, then G contains a spanning 3-ended tree, where σk(G)=min{∑v∈Sdeg(v):S is an independent set of G with S=k}.
Xiaodong Chen, Meijin Xu, Yanjun Liu
doaj +1 more source
Incremental Network Design with Minimum Spanning Trees
Journal of Graph Algorithms and Applications, 2017 Given an edge-weighted graph $G=(V,E)$ and a set $E_0\subset E$, the incremental network design problem with minimum spanning trees asks for a sequence of edges $e'_1,\ldots,e'_T\in E\setminus E_0$ minimizing $\sum_{t=1}^Tw(X_t)$ where $w(X_t)$ is ...
Konrad Engel +2 more
doaj +1 more source
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj +1 more source
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Number of Spanning Trees of Cartesian and Composition Products of Graphs and Chebyshev Polynomials
IEEE Access, 2019 Enumerating all the spanning trees of a graph without duplication is one of the widely studied problems in electrical engineering and computer science literature.
S. N. Daoud
doaj +1 more source
EL-labelings and canonical spanning trees for subword complexes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide canonical spanning trees of the facet-ridge graph of the subword complex ...
Vincent Pilaud, Christian Stump
doaj +1 more source
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.The presence of biotin‐binding avidin proteins in fish and their biological significance are poorly characterized. We cataloged fish avidins and demonstrate that they are widely present and evolutionarily conserved. We created avd knockout zebrafish and show that zebavidin is dispensable for development and that resistance of avd knockout embryos in ...
Anni K. Saralahti +5 more
wiley +1 more source
Fast reoptimization for the minimum spanning tree problem [PDF]
, 2010 We study reoptimization versions of the minimum spanning tree problem. The reoptimization setting can generally be formulated as follows: given an instance of the problem for which we already know some optimal solution, and given some “small ...
Paschos, Vangelis Th. +4 more
core +1 more source
Guarded Second-Order Logic, Spanning Trees, and Network Flows [PDF]
Logical Methods in Computer Science, 2010 According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the first part of the
Achim Blumensath
doaj +1 more source