THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS
From MaRDI portal
Publication:5401566
DOI10.1142/S0129054113500275zbMath1310.68026MaRDI QIDQ5401566
Publication date: 10 March 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items
Fault tolerance of hypercube like networks: spanning laceability under edge faults, Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements, One-to-one disjoint path covers on multi-dimensional tori, Hamiltonicity of the Torus Network Under the Conditional Fault Model
Cites Work
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
- The super laceability of the hypercubes
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- The spanning connectivity of folded hypercubes
- On the spanning connectivity and spanning laceability of hypercube-like networks
- Edge-disjoint spanners in tori
- The super-connected property of recursive circulant graphs
- DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
