Completely independent spanning trees in torus networks

DOI10.1002/net.20460zbMath1251.68034OpenAlexW2162483260MaRDI QIDQ4648692

Chie Morisaka, Toru Hasunuma

Publication date: 15 November 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20460

zbMATH Keywords

fault toleranceCartesian productinterconnection networkedge-disjoint spanning treescompletely independent spanning treestorus network

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items

Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ Degree condition for completely independent spanning trees ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ Two completely independent spanning trees of claw-free graphs ⋮ Ore's condition for completely independent spanning trees ⋮ Two completely independent spanning trees of split graphs ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Completely independent spanning trees in line graphs ⋮ Two completely independent spanning trees of \(P_4\)-free graphs ⋮ New comments on ``A Hamilton sufficient condition for completely independent spanning tree ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Reliability analysis based on the dual-CIST in shuffle-cubes ⋮ Completely independent spanning trees in some regular graphs ⋮ Structural properties of subdivided-line graphs ⋮ A well-equalized 3-CIST partition of alternating group graphs ⋮ Constructing dual-CISTs of DCell data center networks ⋮ Completely independent spanning trees in (partial) \(k\)-trees ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Degree conditions for completely independent spanning trees of bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Independent spanning trees of chordal rings
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• The multi-tree approach to reliability in distributed networks
• Hamilton decompositions of Cartesian products of graphs
• Independent trees in planar graphs
• Independent trees in graphs
• On edge-disjoint spanning trees in hypercubes
• Edge-disjoint spanning trees for the generalized butterfly networks and their applications
• Balancing two spanning trees
• Vertex disjoint routings of cycles over tori
• Three tree-paths
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Diameter-preserving orientations of the torus
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees
• Completely independent spanning trees in the underlying graph of a line digraph
• Independent spanning trees with small depths in iterated line digraphs
• Multicast in wormhole-switched torus networks using edge-disjoint spanning trees.

This page was built for publication: Completely independent spanning trees in torus networks