Construction of optimal independent spanning trees on folded hypercubes

DOI10.1016/J.INS.2013.07.016MaRDI QIDQ497932zbMATHOpenAlexFDO

Authors Xiebin 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

interconnection networkfolded hypercubefault-tolerant broadcastingindependent spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Independent spanning trees on folded hyper-stars
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• A comment on ``Independent spanning trees in crossed cubes
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

Cites work

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

Cited in

(8)

• Odd cycles embedding on folded hypercubes with conditional faulty edges
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Modelling simultaneous broadcasting by level-disjoint partitions
• Independent spanning trees on folded hyper-stars
• The Kirchhoff index of folded hypercubes and some variant networks
• Edge-independent spanning trees in folded crossed cubes
• Some properties on Estrada index of folded hypercubes networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497932)