Independent spanning trees on folded hyper-stars
DOI10.1002/NET.20389zbMATH Open1209.68029OpenAlexW2105073294MaRDI QIDQ3064044FDOQ3064044
Authors: Jinn-Shyong Yang, Jou-Ming Chang 
Publication date: 20 December 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20389
Recommendations
- Construction of optimal independent spanning trees on folded hypercubes
- On independent spanning trees
- Edge-independent spanning trees in folded crossed cubes
- Independent spanning trees on twisted cubes
- Independent spanning trees on even networks
- Independent spanning trees in crossed cubes
- Independent spanning trees in crossed cubes
- Independent Spanning Trees on Multidimensional Torus Networks
- Spanning graphs of hypercubes: Starlike and double starlike trees
- Spanning trees in hyperbolic graphs
interconnection networksindependent spanning treesfault-tolerant broadcastingsecure message distributionfolded hyper-stars
Trees (05C05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Optimum broadcasting and personalized communication in hypercubes
- The multi-tree approach to reliability in distributed networks
- Independent spanning trees of chordal rings
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Title not available (Why is that?)
- Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
- Independent spanning trees with small depths in iterated line digraphs
- Independent trees in planar graphs
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- Independent Spanning Trees on Multidimensional Torus Networks
- Finding Four Independent Trees
- Structural properties of hyper-stars.
- Embedding hypercubes, rings, and odd graphs into hyper-stars
- Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
Cited In (8)
- Independent spanning trees in crossed cubes
- Edge-independent spanning trees in folded crossed cubes
- Construction independent spanning trees on locally twisted cubes in parallel
- Constructing node-independent spanning trees in augmented cubes
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- An improved algorithm to construct edge-independent spanning trees in augmented cubes
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- Construction of optimal independent spanning trees on folded hypercubes
This page was built for publication: Independent spanning trees on folded hyper-stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064044)
