Three completely independent spanning trees of crossed cubes with application to secure-protection routing
type: Item
instance of: scholarly article
title: Three completely independent spanning trees of crossed cubes with application to secure-protection routing
zbMATH Open document ID: 1475.68250
author: Kung-Jui Pai
author: Ruay-Shiung Chang
author: Ro-Yu Wu
author: Jou-Ming Chang
published in: Information Sciences
publication date: 2021-11-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7436049
zbMATH Keywords: completely independent spanning trees
zbMATH Keywords: crossed cubes
zbMATH Keywords: interconnection networks
zbMATH Keywords: secure-protection routing
zbMATH Keywords: tree searching algorithms
MaRDI profile type: Publication
full work available at URL: j.ins.2020.05.048
OpenAlex ID: W3027335499
cites work: Dirac's Condition for Completely Independent Spanning Trees
cites work: A comment on ``Independent spanning trees in crossed cubes''
cites work: A note on path embedding in crossed cubes with faulty vertices
cites work: Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
cites work: Independent spanning trees in crossed cubes
cites work: Constructing completely independent spanning trees in crossed cubes
cites work: Completely independent spanning trees in some regular graphs
cites work: Topological properties of the crossed cube architecture
cites work: Ore's condition for completely independent spanning trees
cites work: Completely independent spanning trees in the underlying graph of a line digraph
cites work: Q4414501
cites work: Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
cites work: Completely independent spanning trees in torus networks
cites work: Degree condition for completely independent spanning trees
cites work: A Hamilton sufficient condition for completely independent spanning tree
cites work: Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
cites work: Completely independent spanning trees in (partial) \(k\)-trees
cites work: Constructing two completely independent spanning trees in hypercube-variant networks
cites work: Two counterexamples on completely independent spanning trees
cites work: Constructing dual-CISTs of DCell data center networks
cites work: Sufficient conditions for protection routing in IP networks
DOI: 10.1016/J.INS.2020.05.048
description: scientific article; zbMATH DE number 7436049