Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

DOI10.1016/J.IPL.2010.03.012zbMATH Open1229.68057OpenAlexW2040681998MaRDI QIDQ656593FDOQ656593

Authors: Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang 

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.012

Recommendations

• Constructing edge-disjoint spanning trees in twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Independent spanning trees on twisted cubes
• Constructing independent spanning trees for locally twisted cubes
• Construction independent spanning trees on locally twisted cubes in parallel

zbMATH Keywords

interconnection networksedge-disjoint spanning treesindependent spanning treeslocally twisted cubesfault-tolerant broadcasting

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Constructing edge-disjoint spanning trees in locally twisted cubes
• Locally twisted cubes are 4-pancyclic.
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Panconnectivity of locally twisted cubes
• A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
• The locally twisted cubes
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• Optimum broadcasting and personalized communication in hypercubes
• 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
• Independent spanning trees with small depths in iterated line digraphs
• Independent trees in planar graphs
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Edge-disjoint spanning trees on the star network with applications to fault tolerance

Cited In (28)

• The generalized 4-connectivity of locally twisted cubes
• A comment on ``Independent spanning trees in crossed cubes
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• Edge-independent spanning trees in augmented cubes
• Independent spanning trees on twisted cubes
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
• Independent spanning trees in crossed cubes
• Locally exchanged twisted cubes: connectivity and super connectivity
• A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
• Edge-independent spanning trees in folded crossed cubes
• Constructing independent spanning trees for locally twisted cubes
• Fault-tolerant edge-pancyclicity of locally twisted cubes
• Construction independent spanning trees on locally twisted cubes in parallel
• Changing the diameter of the locally twisted cube
• Constructing edge-disjoint spanning trees in twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Independent spanning trees on even networks
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Improving the diameters of completely independent spanning trees in locally twisted cubes
• On edge-disjoint spanning trees in hypercubes
• A two-stages tree-searching algorithm for finding three completely independent spanning trees
• Embedding mutually edge-disjoint cycles into locally twisted cubes
• Optimal broadcasting for locally twisted cubes
• Construction of optimal independent spanning trees on folded hypercubes
• Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• An algorithm to construct independent spanning trees on parity cubes

This page was built for publication: Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

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