Constructing tri-CISTs in shuffle-cubes

DOI10.1007/978-3-030-89543-3_28OpenAlexW3210345914MaRDI QIDQ5925687

Kung-Jui Pai, Jou-Ming Chang, Yu-Han Chen, Hsin-Jung Lin

Publication date: 30 March 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_28

zbMATH Keywords

diameterinterconnection networkscompletely independent spanning treesshuffle-cubes

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Constructing two completely independent spanning trees in hypercube-variant networks
• Two counterexamples on completely independent spanning trees
• Constructing completely independent spanning trees in crossed cubes
• Completely independent spanning trees in some regular graphs
• The super connectivity of shuffle-cubes
• The shuffle-cubes and their generalization
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing
• The component (edge) connectivity of shuffle-cubes
• Constructing dual-CISTs of folded divide-and-swap cubes
• Reliability analysis based on the dual-CIST in shuffle-cubes
• A well-equalized 3-CIST partition of alternating group graphs
• Constructing dual-CISTs of DCell data center networks
• A two-stages tree-searching algorithm for finding three completely independent spanning trees
• Dirac's Condition for Completely Independent Spanning Trees
• Completely independent spanning trees in torus networks
• Completely independent spanning trees in the underlying graph of a line digraph
• Unnamed Item

This page was built for publication: Constructing tri-CISTs in shuffle-cubes