Results 241 to 250 of about 3,644,794 (274)
Some of the next articles are maybe not open access.
Degree condition for completely independent spanning trees
Information Processing Letters, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qinghai Liu
exaly +2 more sources
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jou-Ming Chang, Jinn-Shyong Yang
exaly +4 more sources
Independent spanning trees in crossed cubes
Information Sciences, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baolei Cheng +3 more
openaire +6 more sources
Independent spanning trees with small depths in iterated line digraphs [PDF]
Discrete Applied Mathematics, 2001 We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line digraphs.
Toru Hasunuma, Hiroshi Nagamochi
exaly +2 more sources
On Independent Spanning Trees in Random Graphs
A central challenge in network design is ensuring resilience: how can we guarantee multiple, independent, communication pathways between nodes, even when some connections fail in a network?
Nemanja Draganic +4 more
core +3 more sources
Completely independent spanning trees in the underlying graph of a line digraph [PDF]
Discrete Mathematics, 2001 In this note, we define completely independent spanning trees. We say that T1,T2,…,Tk are completely independent spanning trees in a graph H if for any vertex r of H, they are independent spanning trees rooted at r.
Toru Hasunuma
exaly +2 more sources
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Wang 0078 +3 more
openaire +1 more source
Independent Spanning Trees on Folded Hypercubes
2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009Fault-tolerant broadcasting and secure message distribution are important issues for numerous applications in networks. It is a common idea to design multiple spanning trees with a specific property in the underlying graph of a network to serve as a broadcasting scheme or a distribution protocol for receiving high levels of fault-tolerance and of ...
Jinn-Shyong Yang +2 more
openaire +1 more source
Independent Spanning Trees in RTCC-Pyramids
The Computer Journal, 2016The independent spanning trees (ISTs) problem is asked to find k spanning trees rooted at a designated vertex r such that, for any vertex v, all paths connecting r and v in k spanning trees are pairwise internally disjoint in the given graph. ISTs have numerous applications in networks such as reliable communication protocols, data broadcasting and ...
Wang, SI (Wang, Shuo-I) +1 more
openaire +1 more source
Independent spanning trees of product graphs
1997A graph G is called an n-channel graph at vertex r if there are n independent spanning trees rooted at r. A graph G is called an n-channel graph if for every vertex u, G is an n-channel graph at u. Independent spanning trees of a graph play an important role in faulttolerant broadcasting in the graph.
Koji Obokata +3 more
openaire +3 more sources