Three completely independent spanning trees of crossed cubes with application to secure-protection routing

DOI10.1016/J.INS.2020.05.048MaRDI QIDQ2053847zbMATH OpenOpenAlexFDO

Authors Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang

Publication date 30 November 2021

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

completely independent spanning treescrossed cubesinterconnection networkssecure-protection routingtree searching algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Constructing dual-CISTs of folded divide-and-swap cubes
• Constructing completely independent spanning trees in crossed cubes
• Constructing tri-CISTs in shuffle-cubes
• Independent spanning trees in crossed cubes
• A two-stages tree-searching algorithm for finding three completely independent spanning trees

Cites work

• A comment on ``Independent spanning trees in crossed cubes
• A Hamilton sufficient condition for completely independent spanning tree
• A note on path embedding in crossed cubes with faulty vertices
• Completely independent spanning trees in (partial) \(k\)-trees
• Completely independent spanning trees in some regular graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Completely independent spanning trees in torus networks
• Constructing completely independent spanning trees in crossed cubes
• Constructing dual-CISTs of DCell data center networks
• Constructing two completely independent spanning trees in hypercube-variant networks
• Degree condition for completely independent spanning trees
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Dirac's condition for completely independent spanning trees
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• Independent spanning trees in crossed cubes
• Independent spanning trees in crossed cubes
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Ore's condition for completely independent spanning trees
• Sufficient conditions for protection routing in IP networks
• Topological properties of the crossed cube architecture
• Two counterexamples on completely independent spanning trees

Cited in

(13)

• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
• Constructing dual-CISTs of folded divide-and-swap cubes
• Constructing tri-CISTs in shuffle-cubes
• Constructing tri-CISTs in shuffle-cubes
• A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
• Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
• Vertex-independent spanning trees in complete Josephus cubes
• A sufficient condition for the existence of two completely independent spanning trees
• The path-connectivity of hierarchical cubic networks
• An innovative algorithm for generating three completely independent spanning trees in folded hypercube networks
• Embedding crossed cube into diverse product graphs and tree-derived architectures
• Edge-disjoint Hamiltonian cycles in balanced hypercubes with applications to fault-tolerant data broadcasting

This page was built for publication: Three completely independent spanning trees of crossed cubes with application to secure-protection routing

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