Independent spanning trees on folded hyper-stars

DOI10.1002/net.20389zbMath1209.68029OpenAlexW2105073294MaRDI QIDQ3064044

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

zbMATH Keywords

interconnection networksindependent spanning treesfault-tolerant broadcastingsecure message distributionfolded hyper-stars

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items

Construction independent spanning trees on locally twisted cubes in parallel ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ Independent spanning trees in crossed cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Independent spanning trees of chordal rings
• Constructing edge-disjoint spanning trees in locally twisted cubes
• The multi-tree approach to reliability in distributed networks
• Independent trees in planar graphs
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Three tree-paths
• Embedding hypercubes, rings, and odd graphs into hyper-stars
• 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
• Independent Spanning Trees on Multidimensional Torus Networks
• Optimum broadcasting and personalized communication in hypercubes
• Finding Four Independent Trees
• Independent spanning trees with small depths in iterated line digraphs