\(\{2,3\}\)-restricted connectivity of locally twisted cubes

DOI10.1016/j.tcs.2015.11.050zbMath1334.68025OpenAlexW2209020398MaRDI QIDQ906388

Sun-Yuan Hsieh, Hong-Wen Huang, Chia-Wei Lee

Publication date: 21 January 2016

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

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

zbMATH Keywords

graph theorymultiprocessor systemsrestricted connectivitylocally twisted cubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (20)

How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ The \(g\)-good-neighbor conditional diagnosability of locally twisted cubes ⋮ Embedding mutually edge-disjoint cycles into locally twisted cubes ⋮ Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ The generalized 4-connectivity of locally twisted cubes ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks ⋮ \( R_3\)-connectivity of folded hypercubes ⋮ Structure connectivity and substructure connectivity of wheel networks ⋮ The \(h\)-restricted connectivity of the generalized hypercubes ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices ⋮ The generalized 4-connectivity of hypercubes ⋮ Characterizations of optimal component cuts of locally twisted cubes ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ The number of short cycles in Fibonacci cubes ⋮ Structure connectivity and substructure connectivity of bubble-sort star graph networks ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Conditional edge connectivity of the locally twisted cubes ⋮ Communication Performance Evaluation of the Locally Twisted Cube

Cites Work

• Unnamed Item
• Unnamed Item
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• Extraconnectivity of \(k\)-ary \(n\)-cube networks
• K-restricted edge connectivity for some interconnection networks
• The super connectivity of augmented cubes
• The super connectivity of shuffle-cubes
• Extraconnectivity of graphs with large girth
• On a kind of restricted edge connectivity of graphs
• A kind of conditional fault tolerance of alternating group graphs
• A kind of conditional fault tolerance of \((n, k)\)-star graphs
• Conditional connectivity of Cayley graphs generated by transposition trees
• Locally twisted cubes are 4-pancyclic.
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Optimally super-edge-connected transitive graphs
• On the extraconnectivity of graphs
• Restricted connectivity for three families of interconnection networks
• Fault-tolerant analysis of a class of networks
• Conditional connectivity
• Fault Tolerance on Star Graphs
• The locally twisted cubes
• On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes

This page was built for publication: \(\{2,3\}\)-restricted connectivity of locally twisted cubes