Journal of Combinatorial Theory Series B
Computer
A scheme to construct distance-three codes using Latin squares, with applications to the n-cube
Information Processing Letters
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Kronecker products of paths and cycles: decomposition, factorization and bi-pancyclicity
Discrete Mathematics - Special issue on Graph theory
Processor Scheduling and Allocation for 3D Torus Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
Smallest independent dominating sets in Kronecker products of cycles
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Computational Arrays with Flexible Redundancy
IEEE Transactions on Computers
Diagonal and Toroidal Mesh Networks
IEEE Transactions on Computers
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
Quotients of Gaussian graphs and their application to perfect codes
Journal of Symbolic Computation
Reflections about a single checksum
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
Journal of Parallel and Distributed Computing
| Hi-index | 0.89 |
If r ≥ 1, and m and n are each a multiple of (r + 1)2 + r2, then each isomorphic component of Cm × Cn admits of a vertex partition into (r + 1)2 + r2 perfect r-dominating sets. The result induces a dense packing of Cm × Cn by means of vertexdisjoint subgraphs, each isomorphic to a diagonal array. Areas of applications include efficient resource placement in a diagonal mesh and error-correcting codes.