Construction of optimal independent spanning trees on folded hypercubes
DOI10.1016/J.INS.2013.07.016zbMATH Open1337.68201OpenAlexW2029175114MaRDI QIDQ497932FDOQ497932
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
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
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)
Cites Work
- Cycles in folded hypercubes
- Graph theory with applications
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- Fault-free cycles in folded hypercubes with more faulty elements
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- 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
- Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
- On reliability of the folded hypercubes
- An algorithm to construct independent spanning trees on parity cubes
- Independent trees in planar graphs
- 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
- Independent Spanning Trees on Multidimensional Torus Networks
- Finding Four Independent Trees
- Independent spanning trees in crossed cubes
- Independent spanning trees on twisted cubes
- Independent spanning trees on even networks
- The spanning connectivity of folded hypercubes
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- Reliable broadcasting in product networks
- Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
- Constructing edge-disjoint spanning trees in twisted cubes
- Independent spanning trees on folded hyper-stars
- w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)
- Some results on topological properties of folded hypercubes
Cited In (8)
- Some properties on Estrada index of folded hypercubes networks
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
- Edge-independent spanning trees in folded crossed cubes
- Independent spanning trees on folded hyper-stars
- Modelling simultaneous broadcasting by level-disjoint partitions
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- Odd cycles embedding on folded hypercubes with conditional faulty edges
- The Kirchhoff index of folded hypercubes and some variant 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)
