Paths and cycles identifying vertices in twisted cubes
Author:
- Pao-Lien LaiPLPao-Lien Lai
- 1 May 2015
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 259, 620-627
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- Efficient unicast in bijective connection networks with the restricted faulty node setInformation Sciences, 2011
- A novel algorithm to embed a multi-dimensional torus into a locally twisted cubeTheoretical Computer Science, 2011
- A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cubeInformation Sciences, 2010
- Edge-fault-tolerant node-pancyclicity of twisted cubesInformation Processing Letters, 2009
- Two families of optimal identifying codes in binary Hamming spacesIEEE Transactions on Information Theory, 2002
- Sequences of optimal identifying codesIEEE Transactions on Information Theory, 2002
- Bounds on identifying codesDiscrete Mathematics, 2001
- On codes identifying vertices in the two-dimensional square lattice with diagonalsIEEE Transactions on Computers, 2001
- On a new class of codes for identifying vertices in graphsIEEE Transactions on Information Theory, 1998
- Optimal simulation of linear multiprocessor architectures on multiply-twisted cube using generalized Gray CodesIEEE Transactions on Parallel and Distributed Systems, 1996