Construction of optimal independent spanning trees on folded hypercubes

DOI10.1016/j.ins.2013.07.016zbMath1337.68201OpenAlexW2029175114MaRDI QIDQ497932

Xie-Bin Chen

Publication date: 25 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.07.016

zbMATH Keywords

independent spanning treeinterconnection networkfolded hypercubefault-tolerant broadcasting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

The Kirchhoff index of folded hypercubes and some variant networks ⋮ Some properties on Estrada index of folded hypercubes networks ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Modelling simultaneous broadcasting by level-disjoint partitions

Cites Work

• Unnamed Item
• Independent spanning trees of chordal rings
• Independent spanning trees on even networks
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Independent spanning trees on twisted cubes
• On reliability of the folded hypercubes
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Fault-free cycles in folded hypercubes with more faulty elements
• Some results on topological properties of folded hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• The spanning connectivity of folded hypercubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• 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
• Independent trees in planar graphs
• Reliable broadcasting in product networks
• 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
• An algorithm to construct independent spanning trees on parity cubes
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Cycles in folded hypercubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Independent spanning trees on folded hyper-stars
• Three tree-paths
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees
• Independent spanning trees in crossed cubes

This page was built for publication: Construction of optimal independent spanning trees on folded hypercubes