Constructing two completely independent spanning trees in hypercube-variant networks

DOI10.1016/J.TCS.2016.08.024zbMath1353.05118OpenAlexW2517622740MaRDI QIDQ338381

Kung-Jui Pai, Jou-Ming Chang

Publication date: 4 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.024

zbMATH Keywords

diameterCIST-partitioncompletely independent spanning treeshypercube-variant networks

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ 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 ⋮ 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 ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)

Cites Work

• Unnamed Item
• Ore's condition for completely independent spanning trees
• Two counterexamples on completely independent spanning trees
• Constructing completely independent spanning trees in crossed cubes
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• The twisted-cube connected networks
• An algorithm to construct independent spanning trees on parity cubes
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Dirac's Condition for Completely Independent Spanning Trees
• The Mobius cubes
• Completely independent spanning trees in torus networks
• The locally twisted cubes
• Completely independent spanning trees in the underlying graph of a line digraph
• Independent spanning trees with small depths in iterated line digraphs

This page was built for publication: Constructing two completely independent spanning trees in hypercube-variant networks