Independent spanning trees - Open Access .click

Results 251 to 260 of about 140,549 (266)

Some of the next articles are maybe not open access.

Constructing Independent Spanning Trees in Alternating Group Networks

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 independent spanning trees (ISTs). ISTs have numerous applications, such as secure message distribution and fault-tolerant broadcasting.
Jie-Fu Huang, Sun-Yuan Hsieh
openaire +1 more source

Construction of optimal independent spanning trees on folded hypercubes

Information Sciences, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

Dirac's Condition for Completely Independent Spanning Trees

Journal of Graph Theory, 2014
Toru Araki
exaly

Completely independent spanning trees in the underlying graph of a line digraph

Discrete Mathematics, 2001
Toru Hasunuma
exaly

Completely independent spanning trees in torus networks

Networks, 2012
Toru Hasunuma
exaly

On the independent spanning trees of recursive circulant graphsG(cdm,d)withd>2

Theoretical Computer Science, 2009
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang +2 more
exaly

Independent spanning trees of chordal rings

Information Processing Letters, 1999
Yoshihide Igarashi
exaly