Completely independent spanning trees in torus networks
From MaRDI portal
Publication:4648692
DOI10.1002/NET.20460zbMATH Open1251.68034OpenAlexW2162483260MaRDI QIDQ4648692FDOQ4648692
Authors: Toru Hasunuma, Chie Morisaka 
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
Recommendations
- Completely independent spanning trees in some regular graphs
- scientific article; zbMATH DE number 1953097
- On completely independent spanning trees in powers of graphs
- Completely independent spanning trees in \(k\)-th power of graphs
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
fault toleranceinterconnection networkCartesian productedge-disjoint spanning treescompletely independent spanning treestorus network
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)
Cites Work
- The multi-tree approach to reliability in distributed networks
- Independent trees in graphs
- On edge-disjoint spanning trees in hypercubes
- Independent spanning trees of chordal rings
- 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
- Title not available (Why is that?)
- Completely independent spanning trees in the underlying graph of a line digraph
- Independent spanning trees with small depths in iterated line digraphs
- Independent trees in planar graphs
- Hamilton decompositions of Cartesian products of graphs
- Independent Spanning Trees on Multidimensional Torus Networks
- Finding Four Independent Trees
- Diameter-preserving orientations of the torus
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Multicast in wormhole-switched torus networks using edge-disjoint spanning trees.
- Vertex disjoint routings of cycles over tori
- Title not available (Why is that?)
- Balancing two spanning trees
- Edge-disjoint spanning trees for the generalized butterfly networks and their applications
Cited In (31)
- New comments on ``A Hamilton sufficient condition for completely independent spanning tree
- Two completely independent spanning trees of split graphs
- Completely independent spanning trees in line graphs
- Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph
- Completely independent spanning trees in some regular graphs
- Finding totally independent spanning trees with linear integer programming
- On completely independent spanning trees in powers of graphs
- Critical spanning tree and linear arrangement of torus
- Independent spanning trees on even networks
- Degree conditions for completely independent spanning trees of bipartite graphs
- Improving the diameters of completely independent spanning trees in locally twisted cubes
- Constructing dual-CISTs of DCell data center networks
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- Title not available (Why is that?)
- Constructing two completely independent spanning trees in hypercube-variant networks
- A well-equalized 3-CIST partition of alternating group graphs
- Ore's condition for completely independent spanning trees
- Completely independent spanning trees in (partial) \(k\)-trees
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- Constructing tri-CISTs in shuffle-cubes
- Constructing tri-CISTs in shuffle-cubes
- Degree condition for completely independent spanning trees
- Constructing completely independent spanning trees in crossed cubes
- Two completely independent spanning trees of claw-free graphs
- Two completely independent spanning trees of \(P_4\)-free graphs
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
- Dirac's condition for completely independent spanning trees
- Structural properties of subdivided-line graphs
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
- Reliability analysis based on the dual-CIST in shuffle-cubes
- Independent spanning trees of product graphs
This page was built for publication: Completely independent spanning trees in torus networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648692)
