Paths and cycles identifying vertices in twisted cubes
type: Item
instance of: scholarly article
title: Paths and cycles identifying vertices in twisted cubes
zbMATH Open document ID: 1392.68076
author: Pao-Lien Lai
published in: Applied Mathematics and Computation
publication date: 2018-06-07T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6881753
zbMATH Keywords: identification
zbMATH Keywords: fault diagnosis
zbMATH Keywords: Gray code
zbMATH Keywords: twisted cubes
zbMATH Keywords: path
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: j.amc.2015.02.090
OpenAlex ID: W2066347206
cites work: Q5422499
cites work: Q4948746
cites work: Bounds on identifying codes
cites work: Topological properties of twisted cube
cites work: General bounds for identifying codes in some infinite regular graphs
cites work: The minimum density of an identifying code in the king lattice.
cites work: Identifying codes with small radius in some infinite regular graphs
cites work: A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
cites work: Bounds for codes identifying vertices in the hexagonal grid
cites work: On codes identifying vertices in the two-dimensional square lattice with diagonals
cites work: Algorithms and Computation
cites work: Embedding of cycles in twisted cubes with edge-pancyclic
cites work: Efficient unicast in bijective connection networks with the restricted faulty node set
cites work: An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
cites work: Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
cites work: Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
cites work: On codes identifying sets of vertices in Hamming spaces
cites work: Constructing edge-disjoint spanning trees in locally twisted cubes
cites work: Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
cites work: On a new class of codes for identifying vertices in graphs
cites work: Sequences of optimal identifying codes
cites work: Embedding of tori and grids into twisted cubes
cites work: Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
cites work: A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
cites work: Families of optimal codes for strong identification
cites work: A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
cites work: The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
cites work: Optimization of Reduced Dependencies for Synchronous Sequential Machines
cites work: Two families of optimal identifying codes in binary Hamming spaces
cites work: Edge-fault-tolerant node-pancyclicity of twisted cubes
DOI: 10.1016/J.AMC.2015.02.090
description: scientific article; zbMATH DE number 6881753