Paths and cycles identifying vertices in twisted cubes
From MaRDI portal
Publication:1636884
DOI10.1016/j.amc.2015.02.090zbMath1392.68076OpenAlexW2066347206MaRDI QIDQ1636884
Publication date: 7 June 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.02.090
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)
Related Items
Super spanning connectivity on WK-recursive networks ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes
Cites Work
- Unnamed Item
- Unnamed Item
- The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
- Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
- A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
- Efficient unicast in bijective connection networks with the restricted faulty node set
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
- Embedding of tori and grids into twisted cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- The minimum density of an identifying code in the king lattice.
- Families of optimal codes for strong identification
- Topological properties of twisted cube
- A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- Two families of optimal identifying codes in binary Hamming spaces
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Algorithms and Computation
- On codes identifying sets of vertices in Hamming spaces
- Bounds on identifying codes
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
