Independent spanning trees on folded hyper-stars

DOI10.1002/NET.20389MaRDI QIDQ3064044zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1322340 (Why is no real title available?)
• Constructing edge-disjoint spanning trees in locally twisted cubes
• 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
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• Embedding hypercubes, rings, and odd graphs into hyper-stars
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Independent Spanning Trees on Multidimensional Torus Networks
• Independent spanning trees of chordal rings
• Independent spanning trees with small depths in iterated line digraphs
• Independent trees in planar graphs
• Optimum broadcasting and personalized communication in hypercubes
• Structural properties of hyper-stars.
• The multi-tree approach to reliability in distributed networks
• Three tree-paths
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

Cited in

(8)

• Independent spanning trees in crossed cubes
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Edge-independent spanning trees in folded crossed cubes
• Construction of optimal independent spanning trees on folded hypercubes
• Constructing node-independent spanning trees in augmented cubes
• Construction independent spanning trees on locally twisted cubes in parallel
• An improved algorithm to construct edge-independent spanning trees in augmented cubes

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)