Improving the diameters of completely independent spanning trees in locally twisted cubes
From MaRDI portal
Publication:1621502
DOI10.1016/j.ipl.2018.09.006zbMath1478.68257OpenAlexW2892671625MaRDI QIDQ1621502
Publication date: 9 November 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2018.09.006
Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)
Related Items (7)
The generalized 4-connectivity of locally twisted cubes ⋮ Symmetric property and reliability of locally twisted cubes ⋮ Characterizations of optimal component cuts of locally twisted cubes ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Conditional edge connectivity of the locally twisted cubes
Cites Work
- Constructing two completely independent spanning trees in hypercube-variant networks
- Ore's condition for completely independent spanning trees
- Two counterexamples on completely independent spanning trees
- Completely independent spanning trees in some regular graphs
- 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
- 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
- Unnamed Item
This page was built for publication: Improving the diameters of completely independent spanning trees in locally twisted cubes
