Results 11 to 20 of about 139,243 (275)
Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs
Mathematics, 2023 A graph with n vertices is called an n-graph. A spanning tree with at most k leaves is referred to as a spanning k-ended tree. Spanning k-ended trees are important in various fields such as network design, graph theory, and communication networks.
Junqing Cai +3 more
doaj +1 more source
Dual Protection Routing Trees on Graphs
Mathematics, 2023 In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node
Kung-Jui Pai
doaj +1 more source
Two Algorithms for Constructing Independent Spanning Trees in (
IEEE Access, 2020 In a graph $G$ , two spanning trees $T_{1}$ and $T_{2}$ are rooted at the same vertex $r$ . If, for every $v \in V(G)$ , the paths from $v$ to the root $r$ in $T_{1}$ and $T_{2}$ are internally vertex-disjoint, they are called independent ...
Jie-Fu Huang +2 more
doaj +1 more source
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
IEEE Access, 2020 A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r.
Jie-Fu Huang +3 more
doaj +1 more source
Progressive Structure from Motion by Iteratively Prioritizing and Refining Match Pairs
Remote Sensing, 2021 Structure from motion (SfM) has been treated as a mature technique to carry out the task of image orientation and 3D reconstruction. However, it is an ongoing challenge to obtain correct reconstruction results from image sets consisting of problematic ...
Teng Xiao +3 more
doaj +1 more source
Node-independent spanning trees in Gaussian networks [PDF]
Journal of Parallel and Distributed Computing, 2017 Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding the end nodes $r$ and $u$.
Zaid Hussain +2 more
openaire +2 more sources
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source
Discrete Analysis, 2023 The Shadow Knows: Empirical Distributions of Minimal Spanning Acycles and Persistence Diagrams of Random Complexes, Discrete Analysis 2023:2, 18 pp. This paper deals with the following natural and important question.
Nicolas Fraiman +2 more
doaj +1 more source
Completely Independent Spanning Trees in Line Graphs
Graphs and Combinatorics, 2023 20 pages with 5 ...
openaire +2 more sources
Journal of Advances in Modeling Earth Systems, 2023 Knowledge of plant hydraulic traits is critical for simulating terrestrial water storage, ecosystem water use, and tree responses to drought. The isotopic composition of tree xylem water (δXYLEM) has proven to be useful for understanding rooting ...
K. Li, S. Kuppel, J. Knighton
doaj +1 more source