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

DOI10.1016/J.INS.2020.05.048zbMath1475.68250OpenAlexW3027335499MaRDI QIDQ2053847

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

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

interconnection networkscompletely independent spanning treescrossed cubessecure-protection routingtree searching algorithms

Mathematics Subject Classification ID

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

Related Items (5)

A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ⋮ Constructing dual-CISTs of folded divide-and-swap cubes ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Constructing tri-CISTs in shuffle-cubes

Cites Work

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

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