Constructing two completely independent spanning trees in hypercube-variant networks

DOI10.1016/J.TCS.2016.08.024MaRDI QIDQ338381zbMATH OpenOpenAlexFDO

Authors 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) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Network design and communication in computer systems (68M10)

Recommendations

• Constructing completely independent spanning trees in crossed cubes
• A two-stages tree-searching algorithm for finding three completely independent spanning trees
• Independent spanning trees in crossed cubes
• Improving the diameters of completely independent spanning trees in locally twisted cubes
• Independent spanning trees on twisted cubes

Cites work

• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• An algorithm to construct independent spanning trees on parity cubes
• 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
• Independent spanning trees with small depths in iterated line digraphs
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• Ore's condition for completely independent spanning trees
• The Mobius cubes
• The locally twisted cubes
• The twisted-cube connected networks
• Two counterexamples on completely independent spanning trees

Cited in

(14)

• Independent spanning trees on even networks
• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• Constructing completely independent spanning trees in crossed cubes
• A well-equalized 3-CIST partition of alternating group graphs
• Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
• Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
• 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
• Reliability analysis based on the dual-CIST in shuffle-cubes
• Improving the diameters of completely independent spanning trees in locally twisted cubes
• A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
• Constructing tri-CISTs in shuffle-cubes
• Constructing dual-CISTs of DCell data center networks
• Constructing tri-CISTs in shuffle-cubes

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

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