Results 21 to 30 of about 139,243 (275)
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
Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks
Journal of Mathematics, 2022 Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks.
Haiqin Liu, Yanling Shao
doaj +1 more source
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Discrete Applied Mathematics, 2018 The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges ...
Darties, Benoit +2 more
openaire +3 more sources
, 2016 Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying concept behind all these orders has been shown: they can be described by a graph ...
Schlipf, Lena, Schmidt, Jens M.
core +2 more sources
The concept of exchangeability in ensemble forecasting [PDF]
Nonlinear Processes in Geophysics, 2011 A set of random variables is exchangeable if its joint distribution function is invariant under permutation of the arguments. The concept of exchangeability is discussed, with a view towards potential application in evaluating ensemble forecasts.
J. Bröcker, H. Kantz
doaj +1 more source
Ore’s condition for completely independent spanning trees
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan, Genghua, Hong, Yanmei, Liu, Qinghai
openaire +2 more sources
Parallel Construction of Edge-independent Spanning Trees in Augmented Cubes [PDF]
Jisuanji kexueIn recent years,more and more research work is being conducted around interconnected networks.Independent spanning trees(ISTs) can be used in reliable transmission,parallel transmission,safe distribution of information,and parallel diagnosis of fault ...
LI Xiajing, CHENG Baolei, FAN Jianxi, WANG Yan, LI Xiaorui
doaj +1 more source
A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm
Information, 2020 We relate the definition of an ultrametric space to the topological distance algorithm—an algorithm defined in the context of peer-to-peer network applications.
Jörg Schäfer
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
Allometric models for improving aboveground biomass estimates in West African savanna ecosystems
Trees, Forests and People, 2021 West African Sudanian savanna ecosystems greatly contribute to local peoples’ livelihoods and climate change mitigation. Yet, the contribution of these ecosystems to carbon storage remains poorly documented due to the lack of accurate biomass predictive ...
Moussa Ganamé +4 more
doaj +1 more source