Results 11 to 20 of about 140,549 (266)
Completely Independent Spanning Trees in (Partial) k-Trees
Discussiones Mathematicae Graph Theory, 2015 Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint.
Matsushita Masayoshi +2 more
doaj +3 more sources
Independent spanning trees in Eisenstein–Jacobi networks [PDF]
The Journal of Supercomputing, 2022 Spanning trees are widely used in networks for broadcasting, fault-tolerance, and securely delivering messages. Hexagonal interconnection networks have a number of real life applications. Examples are cellular networks, computer graphics, and image processing. Eisenstein-Jacobi (EJ) networks are a generalization of hexagonal mesh topology.
Zaid A. Hussain +2 more
openaire +2 more sources
Four Edge-Independent Spanning Trees [PDF]
SIAM Journal on Discrete Mathematics, 2018 22 pages, 4 figures. Presented at the 29th Cumberland Conference on Combinatorics, Graph Theory and Computing at Vanderbilt ...
Alexander Hoyer, Robin Thomas 0001
openaire +2 more sources
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
Independent spanning trees of chordal rings [PDF]
Information Processing Letters, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iwasaki, Yukihiro +3 more
openaire +3 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
The Bernardi process and torsor structures on spanning trees [PDF]
, 2017 Let G be a ribbon graph, i.e., a connected finite graph G together with a cyclic ordering of the edges around each vertex. By adapting a construction due to O.
Baker, Matthew, Wang, Yao
core +1 more source
Sandpiles, spanning trees, and plane duality [PDF]
, 2014 Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associated to G whose order is equal to the number of spanning trees in G. Holroyd et al.
Chan, Melody +5 more
core +4 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